/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:54:35,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:54:35,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:54:35,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:54:35,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:54:35,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:54:35,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:54:35,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:54:35,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:54:35,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:54:35,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:54:35,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:54:35,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:54:35,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:54:35,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:54:35,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:54:35,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:54:35,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:54:35,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:54:35,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:54:35,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:54:35,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:54:35,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:54:35,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:54:35,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:54:35,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:54:35,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:54:35,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:54:35,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:54:35,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:54:35,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:54:35,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:54:35,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:54:35,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:54:35,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:54:35,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:54:35,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:54:35,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:54:35,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:54:35,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:54:35,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:54:35,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf [2022-03-15 22:54:35,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:54:35,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:54:35,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 22:54:35,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 22:54:35,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:54:35,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:54:35,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:54:35,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:54:35,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:54:35,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:54:35,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-15 22:54:35,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-15 22:54:35,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:54:35,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:54:35,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:54:35,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:54:35,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 22:54:35,956 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 22:54:35,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-03-15 22:54:36,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8fe6ae2/31703626474d46f3b87c426a567452f6/FLAG2c2e86357 [2022-03-15 22:54:36,412 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 22:54:36,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-03-15 22:54:36,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8fe6ae2/31703626474d46f3b87c426a567452f6/FLAG2c2e86357 [2022-03-15 22:54:36,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8fe6ae2/31703626474d46f3b87c426a567452f6 [2022-03-15 22:54:36,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:54:36,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 22:54:36,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 22:54:36,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 22:54:36,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 22:54:36,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 10:54:36" (1/1) ... [2022-03-15 22:54:36,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47747eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:36, skipping insertion in model container [2022-03-15 22:54:36,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 10:54:36" (1/1) ... [2022-03-15 22:54:36,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 22:54:36,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 22:54:37,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-15 22:54:37,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 22:54:37,139 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 22:54:37,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-15 22:54:37,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 22:54:37,244 INFO L208 MainTranslator]: Completed translation [2022-03-15 22:54:37,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37 WrapperNode [2022-03-15 22:54:37,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 22:54:37,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:54:37,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:54:37,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:54:37,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,313 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-03-15 22:54:37,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:54:37,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:54:37,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:54:37,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:54:37,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:54:37,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:54:37,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:54:37,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:54:37,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (1/1) ... [2022-03-15 22:54:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:54:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:37,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:54:37,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:54:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 22:54:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 22:54:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 22:54:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 22:54:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 22:54:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:54:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:54:37,405 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:54:37,501 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:54:37,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:54:37,703 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:54:37,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:54:37,715 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 22:54:37,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:54:37 BoogieIcfgContainer [2022-03-15 22:54:37,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:54:37,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:54:37,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:54:37,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:54:37,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 10:54:36" (1/3) ... [2022-03-15 22:54:37,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4ea5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:54:37, skipping insertion in model container [2022-03-15 22:54:37,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:37" (2/3) ... [2022-03-15 22:54:37,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4ea5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:54:37, skipping insertion in model container [2022-03-15 22:54:37,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:54:37" (3/3) ... [2022-03-15 22:54:37,725 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-03-15 22:54:37,729 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:54:37,729 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:54:37,729 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 22:54:37,729 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:54:37,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,796 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,797 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,798 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,799 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,800 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,801 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,802 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,803 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,804 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,805 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,806 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,818 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,819 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,820 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:37,838 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 22:54:37,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-15 22:54:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:37,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-15 22:54:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-15 22:54:37,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:54:37,917 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=false [2022-03-15 22:54:37,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 22:54:38,669 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-15 22:54:38,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1174616020, now seen corresponding path program 1 times [2022-03-15 22:54:38,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:38,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477888310] [2022-03-15 22:54:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:38,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:38,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477888310] [2022-03-15 22:54:38,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477888310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:38,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:38,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:54:38,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035087597] [2022-03-15 22:54:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:38,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 22:54:38,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 22:54:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 22:54:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:38,923 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:38,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:38,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,310 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-15 22:54:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:54:39,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1170051021, now seen corresponding path program 1 times [2022-03-15 22:54:39,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:39,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660411047] [2022-03-15 22:54:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:39,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:39,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660411047] [2022-03-15 22:54:39,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660411047] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:39,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:39,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:39,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578032039] [2022-03-15 22:54:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:39,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:39,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,402 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:39,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:39,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,711 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 158 transitions and produced 124 states. [2022-03-15 22:54:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:39,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:54:39,712 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 323884447, now seen corresponding path program 1 times [2022-03-15 22:54:39,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:39,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778649501] [2022-03-15 22:54:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:39,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:39,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778649501] [2022-03-15 22:54:39,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778649501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:39,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:39,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:39,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809748874] [2022-03-15 22:54:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:39,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:39,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,807 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:39,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:39,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:39,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:39,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,194 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 209 transitions and produced 157 states. [2022-03-15 22:54:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:54:40,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2033537427, now seen corresponding path program 1 times [2022-03-15 22:54:40,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:40,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972837203] [2022-03-15 22:54:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:40,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:40,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972837203] [2022-03-15 22:54:40,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972837203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:40,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:40,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:40,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675089809] [2022-03-15 22:54:40,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:40,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:40,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,267 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:40,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:40,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,739 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 235 transitions and produced 183 states. [2022-03-15 22:54:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 22:54:40,740 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1519561133, now seen corresponding path program 1 times [2022-03-15 22:54:40,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:40,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852565233] [2022-03-15 22:54:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:40,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:40,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852565233] [2022-03-15 22:54:40,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852565233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:40,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:40,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 22:54:40,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588356060] [2022-03-15 22:54:40,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:40,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:54:40,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:54:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:54:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,782 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:40,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:40,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:42,189 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 223 transitions and produced 224 states. [2022-03-15 22:54:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:42,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 22:54:42,190 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -818256019, now seen corresponding path program 1 times [2022-03-15 22:54:42,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:42,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137598340] [2022-03-15 22:54:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:42,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:42,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137598340] [2022-03-15 22:54:42,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137598340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:42,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926143144] [2022-03-15 22:54:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:42,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:42,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:42,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:42,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:54:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:42,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:54:42,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:42,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:42,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926143144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:42,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:42,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:54:42,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414234482] [2022-03-15 22:54:42,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:42,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:54:42,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:54:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:54:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:42,834 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:42,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:42,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:43,901 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 394 transitions and produced 289 states. [2022-03-15 22:54:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:54:43,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 22:54:44,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 22:54:44,116 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash 148992281, now seen corresponding path program 1 times [2022-03-15 22:54:44,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:44,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940610951] [2022-03-15 22:54:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:44,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:44,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940610951] [2022-03-15 22:54:44,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940610951] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:44,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328397563] [2022-03-15 22:54:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:44,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:44,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:54:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:44,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:54:44,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:44,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:44,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328397563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:44,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:44,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:54:44,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51061017] [2022-03-15 22:54:44,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:44,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:54:44,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:54:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:54:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:44,664 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:44,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.9) internal successors, (279), 10 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:44,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:44,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:44,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:44,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:44,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:44,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:54:44,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,718 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 687 transitions and produced 529 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:46,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:46,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:46,933 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1058312109, now seen corresponding path program 2 times [2022-03-15 22:54:46,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:46,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241627643] [2022-03-15 22:54:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:47,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:47,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241627643] [2022-03-15 22:54:47,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241627643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:47,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616728645] [2022-03-15 22:54:47,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:54:47,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:47,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:47,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:47,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:54:47,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:54:47,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:54:47,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:54:47,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:47,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:54:47,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616728645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:47,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:54:47,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-03-15 22:54:47,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064148606] [2022-03-15 22:54:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:47,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:54:47,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:54:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:54:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,502 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:47,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.181818181818183) internal successors, (211), 11 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:47,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:47,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,617 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 715 transitions and produced 557 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:49,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:49,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:49,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1593386593, now seen corresponding path program 1 times [2022-03-15 22:54:49,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:49,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044455503] [2022-03-15 22:54:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:49,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:49,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044455503] [2022-03-15 22:54:49,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044455503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:49,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938388764] [2022-03-15 22:54:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:49,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:49,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:49,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:54:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:50,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:54:50,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:50,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:50,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938388764] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:50,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:50,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:54:50,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370403874] [2022-03-15 22:54:50,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:50,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:54:50,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:54:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:54:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:50,732 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:50,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.076923076923077) internal successors, (313), 13 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:50,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:50,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:50,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:50,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:52,957 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 764 transitions and produced 553 states. [2022-03-15 22:54:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:54:52,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:53,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:53,159 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1431502631, now seen corresponding path program 2 times [2022-03-15 22:54:53,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:53,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898708133] [2022-03-15 22:54:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:53,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:53,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898708133] [2022-03-15 22:54:53,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898708133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:53,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218349900] [2022-03-15 22:54:53,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:54:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:53,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:53,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:54:53,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:54:53,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:54:53,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:54:53,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:53,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:54,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218349900] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:54,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:54,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:54:54,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443290854] [2022-03-15 22:54:54,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:54,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:54:54,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:54:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:54:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:54,006 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:54,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.76923076923077) internal successors, (348), 13 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:54:54,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:57,076 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1085 transitions and produced 821 states. [2022-03-15 22:54:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:54:57,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:57,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:57,296 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1603129695, now seen corresponding path program 2 times [2022-03-15 22:54:57,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:57,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272118842] [2022-03-15 22:54:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:58,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:58,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272118842] [2022-03-15 22:54:58,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272118842] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:58,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902266145] [2022-03-15 22:54:58,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:54:58,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:58,197 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:58,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:54:58,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:54:58,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:54:58,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 22:54:58,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:59,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:55:00,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 22:55:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-03-15 22:55:00,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:55:00,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902266145] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:55:00,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:55:00,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [32] total 52 [2022-03-15 22:55:00,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829914366] [2022-03-15 22:55:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:55:00,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:55:00,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:55:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2522, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:55:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:00,464 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:00,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:00,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:08,346 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1144 transitions and produced 880 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:55:08,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:55:08,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:08,547 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash 390942809, now seen corresponding path program 1 times [2022-03-15 22:55:08,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:08,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144680799] [2022-03-15 22:55:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:08,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 318 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:08,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:08,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144680799] [2022-03-15 22:55:08,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144680799] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:08,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539283812] [2022-03-15 22:55:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:08,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:08,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:55:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:08,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:55:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:09,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:09,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539283812] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:09,945 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:09,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-03-15 22:55:09,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792895420] [2022-03-15 22:55:09,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:09,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:55:09,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:55:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:55:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:09,947 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:09,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 23.62962962962963) internal successors, (638), 27 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:55:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:13,440 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1172 transitions and produced 908 states. [2022-03-15 22:55:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:55:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:55:13,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 22:55:13,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 22:55:13,643 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1682786829, now seen corresponding path program 1 times [2022-03-15 22:55:13,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:13,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803906017] [2022-03-15 22:55:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:14,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:14,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803906017] [2022-03-15 22:55:14,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803906017] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:14,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247095580] [2022-03-15 22:55:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:14,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:14,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:14,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:55:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 22:55:14,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:15,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:55:16,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:55:16,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:55:17,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 22:55:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 74 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-03-15 22:55:18,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:21,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-15 22:55:54,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 22:55:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 73 refuted. 0 times theorem prover too weak. 150 trivial. 1 not checked. [2022-03-15 22:55:55,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247095580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:55,245 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:55,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 29] total 91 [2022-03-15 22:55:55,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504336458] [2022-03-15 22:55:55,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:55,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 22:55:55,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 22:55:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=7693, Unknown=20, NotChecked=176, Total=8190 [2022-03-15 22:55:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:55,249 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:55,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 9.31868131868132) internal successors, (848), 91 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:55:55,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:02,104 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 22:56:07,428 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 22:56:12,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-15 22:56:17,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (+ |c_~#arr~0.offset| 12))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse6)) (.cse4 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse6))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= .cse5 4) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-15 22:56:25,717 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1259 transitions and produced 995 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:56:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:56:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:56:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:56:25,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:56:25,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:56:25,919 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:56:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:56:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash -995008903, now seen corresponding path program 2 times [2022-03-15 22:56:25,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:56:25,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445105417] [2022-03-15 22:56:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:56:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:56:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:56:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:56:27,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:56:27,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445105417] [2022-03-15 22:56:27,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445105417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:56:27,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462735360] [2022-03-15 22:56:27,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:56:27,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:56:27,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:56:27,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:56:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:56:27,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:56:27,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:56:27,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-15 22:56:27,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:56:28,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:56:29,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:56:29,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:56:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:56:30,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:56:32,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 22:56:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-15 22:56:32,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:56:36,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) is different from false [2022-03-15 22:56:52,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) is different from false [2022-03-15 22:57:09,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) is different from false [2022-03-15 22:57:10,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) is different from false [2022-03-15 22:57:11,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) is different from false [2022-03-15 22:57:22,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 22:57:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 211 refuted. 0 times theorem prover too weak. 57 trivial. 22 not checked. [2022-03-15 22:57:23,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462735360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:57:23,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:57:23,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39, 36] total 112 [2022-03-15 22:57:23,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001591187] [2022-03-15 22:57:23,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:57:23,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-03-15 22:57:23,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:57:23,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-03-15 22:57:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=10962, Unknown=19, NotChecked=1070, Total=12432 [2022-03-15 22:57:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:57:23,593 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:57:23,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 9.464285714285714) internal successors, (1060), 112 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:57:23,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:57:28,242 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 22:57:28,912 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-15 22:57:29,541 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-15 22:57:30,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-03-15 22:57:32,184 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-03-15 22:57:35,903 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:37,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:37,690 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 22:57:38,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-15 22:57:40,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-15 22:57:44,761 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse9)) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse3) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:45,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:46,492 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-15 22:57:47,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-15 22:57:49,162 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ |c_~#arr~0.offset| 12) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-15 22:57:53,804 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse3) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:54,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 22:57:55,571 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 22:57:56,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-15 22:57:58,243 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-15 22:58:13,331 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1318 transitions and produced 1054 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:58:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:58:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 22:58:13,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:58:13,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:58:13,533 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:58:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:58:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -43463631, now seen corresponding path program 2 times [2022-03-15 22:58:13,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:58:13,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109670484] [2022-03-15 22:58:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:58:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:58:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:58:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 326 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:58:13,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:58:13,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109670484] [2022-03-15 22:58:13,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109670484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:58:13,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730628406] [2022-03-15 22:58:13,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:58:13,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:58:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:58:13,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:58:13,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:58:13,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:58:13,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:58:13,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:58:13,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:58:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:58:14,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:58:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:58:15,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730628406] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:58:15,228 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:58:15,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2022-03-15 22:58:15,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546276943] [2022-03-15 22:58:15,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:58:15,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:58:15,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:58:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:58:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:58:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:58:15,230 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:58:15,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 25.0) internal successors, (625), 25 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:58:15,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:58:15,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:15,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:15,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:15,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-03-15 22:58:15,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:58:19,508 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1346 transitions and produced 1082 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:58:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 22:58:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:58:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 22:58:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 22:58:19,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:58:19,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:58:19,711 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:58:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:58:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1012345829, now seen corresponding path program 3 times [2022-03-15 22:58:19,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:58:19,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494635798] [2022-03-15 22:58:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:58:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:58:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:58:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:58:21,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:58:21,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494635798] [2022-03-15 22:58:21,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494635798] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:58:21,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787701706] [2022-03-15 22:58:21,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:58:21,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:58:21,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:58:21,294 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:58:21,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:58:21,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:58:21,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:58:21,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 117 conjunts are in the unsatisfiable core [2022-03-15 22:58:21,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:58:22,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:58:23,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:58:23,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:58:24,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:58:24,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:58:25,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:58:25,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 22:58:27,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 22:58:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 477 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 22:58:28,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:58:31,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) is different from false [2022-03-15 22:59:28,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) is different from false [2022-03-15 23:00:19,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-15 23:01:13,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 23:01:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 471 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-03-15 23:01:14,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787701706] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 23:01:14,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 23:01:14,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 43] total 131 [2022-03-15 23:01:14,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745722520] [2022-03-15 23:01:14,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 23:01:14,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-15 23:01:14,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:01:14,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-15 23:01:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=15729, Unknown=67, NotChecked=762, Total=17030 [2022-03-15 23:01:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:14,251 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:01:14,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 9.709923664122137) internal successors, (1272), 131 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:01:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-15 23:01:14,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:21,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-15 23:01:28,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse5 (not .cse2)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse4 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 8 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 23:01:36,697 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse6 (not .cse2)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse4) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse3) (<= 12 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-15 23:01:45,844 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (* c_~top~0 4))) (let ((.cse5 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse7 (not .cse2)) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9))) (.cse1 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8)))) (.cse3 (select .cse8 (+ (- 16) |c_~#arr~0.offset| .cse9)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse5) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 0 .cse6) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse7) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse4) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 16 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse7)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse6 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-03-15 23:02:20,707 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1433 transitions and produced 1169 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:02:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:02:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:02:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 23:02:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 23:02:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:02:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 23:02:20,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 23:02:20,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 23:02:20,924 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 23:02:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 23:02:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1929867857, now seen corresponding path program 4 times [2022-03-15 23:02:20,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 23:02:20,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95688582] [2022-03-15 23:02:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 23:02:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 23:02:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 23:02:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:02:22,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 23:02:22,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95688582] [2022-03-15 23:02:22,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95688582] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 23:02:22,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179946730] [2022-03-15 23:02:22,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 23:02:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:02:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 23:02:22,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 23:02:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 23:02:23,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 23:02:23,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 23:02:23,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 142 conjunts are in the unsatisfiable core [2022-03-15 23:02:23,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 23:02:23,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 23:02:24,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 23:02:24,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-03-15 23:02:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 23:02:25,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-15 23:02:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 23:02:25,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-15 23:02:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 23:02:26,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-15 23:02:29,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 23:02:29,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 23:02:29,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-03-15 23:02:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:02:29,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 23:03:06,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 23:03:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 29 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:03:07,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179946730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 23:03:07,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 23:03:07,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54, 56] total 127 [2022-03-15 23:03:07,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9168973] [2022-03-15 23:03:07,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 23:03:07,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-15 23:03:07,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:03:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-15 23:03:07,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=15361, Unknown=18, NotChecked=0, Total=16002 [2022-03-15 23:03:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:07,292 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:03:07,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 7.94488188976378) internal successors, (1009), 127 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-15 23:03:07,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-15 23:03:07,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:07,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-03-15 23:03:07,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:17,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) .cse2 (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-15 23:03:18,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) .cse2 (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-15 23:03:19,476 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-15 23:03:20,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-15 23:03:21,139 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 12 .cse2) (<= 0 .cse0) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-15 23:03:22,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse8 0)) (.cse7 (= (+ c_~top~0 4) 0)) (.cse6 (+ |c_~#arr~0.offset| .cse9)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse4 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (<= .cse1 4) .cse2 (or .cse3 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse4 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse2 .cse5 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse6)) .cse7) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) 4294967296))) (<= 0 .cse0) (or .cse7 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse9) .cse6) .cse2 .cse5)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse10) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296)))) .cse3) (<= 0 .cse1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8))) 4294967296))) (or .cse4 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-15 23:03:25,585 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))))) is different from false [2022-03-15 23:03:26,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-15 23:03:27,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-15 23:03:29,021 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-15 23:03:30,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= (+ c_~top~0 1) 0)) (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= 0 .cse0) (<= 16 .cse2) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))))) is different from false [2022-03-15 23:03:31,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (= (+ c_~top~0 1) 0)) (.cse0 (select .cse4 0)) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse5 (* c_~top~0 4))) (and (<= .cse0 4) (or (forall ((v_ArrVal_1044 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) .cse1) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (or .cse3 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse1 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12))) 4294967296))) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5)) 4294967296))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse6 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse6))) 4294967296)))) .cse3) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))) 4294967296))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))))) is different from false [2022-03-15 23:03:32,861 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (= (+ c_~top~0 1) 0)) (.cse0 (select .cse5 0)) (.cse10 (= (+ c_~top~0 4) 0)) (.cse9 (+ |c_~#arr~0.offset| .cse6)) (.cse3 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse8 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse4 (= 0 (+ 3 c_~top~0))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (or (forall ((v_ArrVal_1044 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) .cse1) (<= .cse2 4) .cse3 (or .cse4 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse1 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse3 .cse8 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse9)) .cse10) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296))) (<= 0 .cse0) (or .cse10 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) .cse9) .cse3 .cse8)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse11 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse11) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse11))) 4294967296)))) .cse4) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))))) is different from false [2022-03-15 23:03:50,826 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1492 transitions and produced 1228 states. [2022-03-15 23:03:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 23:03:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-03-15 23:03:50,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 23:03:51,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 23:03:51,034 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 23:03:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 23:03:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 941435913, now seen corresponding path program 3 times [2022-03-15 23:03:51,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 23:03:51,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402627939] [2022-03-15 23:03:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 23:03:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 23:03:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 23:03:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 355 proven. 165 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-15 23:03:51,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 23:03:51,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402627939] [2022-03-15 23:03:51,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402627939] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 23:03:51,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137743524] [2022-03-15 23:03:51,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 23:03:51,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:03:51,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 23:03:51,239 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 23:03:51,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 23:03:51,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 23:03:51,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 23:03:51,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 23:03:51,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 23:03:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-15 23:03:52,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 23:03:52,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137743524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 23:03:52,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 23:03:52,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-15 23:03:52,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887733334] [2022-03-15 23:03:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 23:03:52,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 23:03:52,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:03:52,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 23:03:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-15 23:03:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:52,351 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:03:52,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:03:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2022-03-15 23:03:52,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:06:15,186 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8)))) (.cse3 (select .cse6 (+ |c_~#arr~0.offset| 8)))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= c_~top~0 5) (< .cse4 4294967296) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 5 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 23:06:17,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse3 0)) (.cse2 (= (+ c_~top~0 4) 0)) (.cse1 (* c_~top~0 4))) (and (<= .cse0 4) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse2) (<= c_~top~0 5) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse3 (+ (- 16) |c_~#arr~0.offset| .cse1)) 4294967296))) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (<= 5 c_~top~0) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse2) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse4 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296)))))) is different from false [2022-03-15 23:06:19,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-15 23:06:21,132 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (* c_~top~0 4))) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0)))) is different from false [2022-03-15 23:06:22,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 23:06:25,061 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))))) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))) is different from false [2022-03-15 23:06:26,070 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-15 23:06:28,129 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse0 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))) is different from false [2022-03-15 23:06:28,407 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44884 transitions and produced 19841 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:06:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-03-15 23:06:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 23:06:28,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 23:06:28,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:06:28,609 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 23:06:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 23:06:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1842855783, now seen corresponding path program 3 times [2022-03-15 23:06:28,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 23:06:28,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793626845] [2022-03-15 23:06:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 23:06:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 23:06:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 23:06:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 371 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:06:28,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 23:06:28,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793626845] [2022-03-15 23:06:28,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793626845] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 23:06:28,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278669477] [2022-03-15 23:06:28,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 23:06:28,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:06:28,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 23:06:28,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 23:06:28,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 23:06:28,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 23:06:28,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 23:06:28,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 23:06:28,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 23:06:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:06:29,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 23:06:29,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278669477] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 23:06:29,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 23:06:29,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-15 23:06:29,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523406136] [2022-03-15 23:06:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 23:06:29,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 23:06:29,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:06:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 23:06:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-15 23:06:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:06:29,347 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:06:29,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.153846153846153) internal successors, (288), 13 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:06:29,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 191 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-03-15 23:06:29,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-03-15 23:08:23,513 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:08:23,513 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:08:23,515 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:08:23,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 23:08:23,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:08:23,705 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-15 23:08:23,707 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-03-15 23:08:23,707 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 23:08:23,707 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-03-15 23:08:23,707 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 23:08:23,707 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 23:08:23,708 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 23:08:23,712 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 23:08:23,715 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 23:08:23,715 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 23:08:23,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 11:08:23 BasicIcfg [2022-03-15 23:08:23,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 23:08:23,717 INFO L158 Benchmark]: Toolchain (without parser) took 826939.16ms. Allocated memory was 177.2MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 117.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2022-03-15 23:08:23,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 177.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 23:08:23,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.39ms. Allocated memory was 177.2MB in the beginning and 260.0MB in the end (delta: 82.8MB). Free memory was 117.6MB in the beginning and 210.5MB in the end (delta: -93.0MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-03-15 23:08:23,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.54ms. Allocated memory is still 260.0MB. Free memory was 210.5MB in the beginning and 207.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 23:08:23,717 INFO L158 Benchmark]: Boogie Preprocessor took 27.51ms. Allocated memory is still 260.0MB. Free memory was 207.9MB in the beginning and 206.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 23:08:23,718 INFO L158 Benchmark]: RCFGBuilder took 375.25ms. Allocated memory is still 260.0MB. Free memory was 206.3MB in the beginning and 189.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-15 23:08:23,718 INFO L158 Benchmark]: TraceAbstraction took 825998.21ms. Allocated memory was 260.0MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 188.5MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2022-03-15 23:08:23,719 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.17ms. Allocated memory is still 177.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.39ms. Allocated memory was 177.2MB in the beginning and 260.0MB in the end (delta: 82.8MB). Free memory was 117.6MB in the beginning and 210.5MB in the end (delta: -93.0MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.54ms. Allocated memory is still 260.0MB. Free memory was 210.5MB in the beginning and 207.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.51ms. Allocated memory is still 260.0MB. Free memory was 207.9MB in the beginning and 206.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 375.25ms. Allocated memory is still 260.0MB. Free memory was 206.3MB in the beginning and 189.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 825998.21ms. Allocated memory was 260.0MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 188.5MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 294 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 825.8s, OverallIterations: 19, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 490.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 782, 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.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 329.0s InterpolantComputationTime, 9234 NumberOfCodeBlocks, 9191 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 12285 ConstructedInterpolants, 144 QuantifiedInterpolants, 135069 SizeOfPredicates, 334 NumberOfNonLiveVariables, 8698 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 43 InterpolantComputations, 9 PerfectInterpolantSequences, 7538/15992 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