/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 08:50:07,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 08:50:07,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 08:50:07,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 08:50:07,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 08:50:07,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 08:50:07,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 08:50:07,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 08:50:07,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 08:50:07,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 08:50:07,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 08:50:07,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 08:50:07,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 08:50:07,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 08:50:07,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 08:50:07,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 08:50:07,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 08:50:07,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 08:50:07,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 08:50:07,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 08:50:07,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 08:50:07,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 08:50:07,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 08:50:07,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 08:50:07,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 08:50:07,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 08:50:07,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 08:50:07,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 08:50:07,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 08:50:07,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 08:50:07,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 08:50:07,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 08:50:07,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 08:50:07,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 08:50:07,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 08:50:07,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 08:50:07,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 08:50:07,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 08:50:07,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 08:50:07,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 08:50:07,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 08:50:07,895 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-FA-NoLbe-Separate.epf [2022-01-18 08:50:07,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 08:50:07,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 08:50:07,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 08:50:07,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 08:50:07,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 08:50:07,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 08:50:07,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 08:50:07,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 08:50:07,915 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 08:50:07,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 08:50:07,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 08:50:07,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 08:50:07,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 08:50:07,917 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 08:50:07,918 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-01-18 08:50:08,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 08:50:08,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 08:50:08,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 08:50:08,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 08:50:08,095 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 08:50:08,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-01-18 08:50:08,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d12444e8/604d3922cee345a5aa471b56fba2de7c/FLAGe75e8c886 [2022-01-18 08:50:08,605 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 08:50:08,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-01-18 08:50:08,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d12444e8/604d3922cee345a5aa471b56fba2de7c/FLAGe75e8c886 [2022-01-18 08:50:08,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d12444e8/604d3922cee345a5aa471b56fba2de7c [2022-01-18 08:50:08,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 08:50:08,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 08:50:08,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 08:50:08,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 08:50:08,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 08:50:08,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 08:50:08" (1/1) ... [2022-01-18 08:50:08,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10467107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:08, skipping insertion in model container [2022-01-18 08:50:08,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 08:50:08" (1/1) ... [2022-01-18 08:50:08,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 08:50:08,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 08:50:08,942 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-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-01-18 08:50:08,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 08:50:08,962 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 08:50:09,010 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-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-01-18 08:50:09,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 08:50:09,040 INFO L208 MainTranslator]: Completed translation [2022-01-18 08:50:09,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09 WrapperNode [2022-01-18 08:50:09,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 08:50:09,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 08:50:09,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 08:50:09,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 08:50:09,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,091 INFO L137 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 83 [2022-01-18 08:50:09,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 08:50:09,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 08:50:09,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 08:50:09,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 08:50:09,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 08:50:09,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 08:50:09,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 08:50:09,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 08:50:09,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (1/1) ... [2022-01-18 08:50:09,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 08:50:09,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:09,197 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-01-18 08:50:09,202 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-01-18 08:50:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 08:50:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-18 08:50:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 08:50:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 08:50:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 08:50:09,245 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 08:50:09,311 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 08:50:09,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 08:50:09,429 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 08:50:09,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 08:50:09,464 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-18 08:50:09,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 08:50:09 BoogieIcfgContainer [2022-01-18 08:50:09,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 08:50:09,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 08:50:09,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 08:50:09,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 08:50:09,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 08:50:08" (1/3) ... [2022-01-18 08:50:09,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2a3e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 08:50:09, skipping insertion in model container [2022-01-18 08:50:09,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 08:50:09" (2/3) ... [2022-01-18 08:50:09,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2a3e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 08:50:09, skipping insertion in model container [2022-01-18 08:50:09,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 08:50:09" (3/3) ... [2022-01-18 08:50:09,471 INFO L111 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2022-01-18 08:50:09,473 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 08:50:09,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 08:50:09,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 08:50:09,474 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,511 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,512 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,513 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,517 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,519 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,519 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,519 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,519 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,520 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,532 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,532 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,533 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,534 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,535 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,536 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,537 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,538 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:09,546 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 08:50:09,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 08:50:09,579 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=FINITE_AUTOMATA, 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 [2022-01-18 08:50:09,579 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-18 08:50:09,585 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 79 transitions, 163 flow [2022-01-18 08:50:09,633 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 603 states, 600 states have (on average 2.05) internal successors, (1230), 602 states have internal predecessors, (1230), 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-01-18 08:50:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 603 states, 600 states have (on average 2.05) internal successors, (1230), 602 states have internal predecessors, (1230), 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-01-18 08:50:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-18 08:50:09,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:09,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:09,647 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1986405927, now seen corresponding path program 1 times [2022-01-18 08:50:09,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177612043] [2022-01-18 08:50:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:09,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:50:09,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:09,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177612043] [2022-01-18 08:50:09,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177612043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:09,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:09,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 08:50:09,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681463901] [2022-01-18 08:50:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:09,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 08:50:09,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 08:50:09,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 08:50:09,861 INFO L87 Difference]: Start difference. First operand has 603 states, 600 states have (on average 2.05) internal successors, (1230), 602 states have internal predecessors, (1230), 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) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-18 08:50:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:09,918 INFO L93 Difference]: Finished difference Result 326 states and 592 transitions. [2022-01-18 08:50:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 08:50:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) Word has length 46 [2022-01-18 08:50:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:09,934 INFO L225 Difference]: With dead ends: 326 [2022-01-18 08:50:09,934 INFO L226 Difference]: Without dead ends: 270 [2022-01-18 08:50:09,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 08:50:09,939 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:09,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:50:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-18 08:50:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-01-18 08:50:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 269 states have internal predecessors, (487), 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-01-18 08:50:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 487 transitions. [2022-01-18 08:50:10,007 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 487 transitions. Word has length 46 [2022-01-18 08:50:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:10,007 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 487 transitions. [2022-01-18 08:50:10,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-18 08:50:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 487 transitions. [2022-01-18 08:50:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-18 08:50:10,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:10,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:10,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 08:50:10,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1644178190, now seen corresponding path program 1 times [2022-01-18 08:50:10,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:10,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019580609] [2022-01-18 08:50:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:10,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:50:10,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:10,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019580609] [2022-01-18 08:50:10,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019580609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:10,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:10,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 08:50:10,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180645608] [2022-01-18 08:50:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:10,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 08:50:10,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:10,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 08:50:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 08:50:10,133 INFO L87 Difference]: Start difference. First operand 270 states and 487 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-01-18 08:50:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:10,264 INFO L93 Difference]: Finished difference Result 510 states and 907 transitions. [2022-01-18 08:50:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 08:50:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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) Word has length 52 [2022-01-18 08:50:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:10,266 INFO L225 Difference]: With dead ends: 510 [2022-01-18 08:50:10,266 INFO L226 Difference]: Without dead ends: 392 [2022-01-18 08:50:10,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-18 08:50:10,267 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 80 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:10,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 394 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 08:50:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-01-18 08:50:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 236. [2022-01-18 08:50:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.7446808510638299) internal successors, (410), 235 states have internal predecessors, (410), 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-01-18 08:50:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 410 transitions. [2022-01-18 08:50:10,285 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 410 transitions. Word has length 52 [2022-01-18 08:50:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:10,286 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 410 transitions. [2022-01-18 08:50:10,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-01-18 08:50:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 410 transitions. [2022-01-18 08:50:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-18 08:50:10,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:10,289 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:10,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 08:50:10,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 972978400, now seen corresponding path program 1 times [2022-01-18 08:50:10,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278441602] [2022-01-18 08:50:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:10,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:10,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278441602] [2022-01-18 08:50:10,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278441602] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614180404] [2022-01-18 08:50:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:10,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:10,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:50:10,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 08:50:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:10,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 08:50:10,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:10,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:10,752 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:10,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:10,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:10,834 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 14 treesize of output 16 [2022-01-18 08:50:10,893 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 15 treesize of output 7 [2022-01-18 08:50:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:10,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:10,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_59 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_59) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:50:10,980 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:10,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:10,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:10,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:11,014 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 24 treesize of output 20 [2022-01-18 08:50:11,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-18 08:50:11,031 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 36 treesize of output 28 [2022-01-18 08:50:11,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-18 08:50:11,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:50:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-01-18 08:50:11,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614180404] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:11,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:11,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-18 08:50:11,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987988662] [2022-01-18 08:50:11,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:11,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 08:50:11,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 08:50:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2022-01-18 08:50:11,461 INFO L87 Difference]: Start difference. First operand 236 states and 410 transitions. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-01-18 08:50:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:11,793 INFO L93 Difference]: Finished difference Result 596 states and 1070 transitions. [2022-01-18 08:50:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 08:50:11,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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) Word has length 58 [2022-01-18 08:50:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:11,795 INFO L225 Difference]: With dead ends: 596 [2022-01-18 08:50:11,795 INFO L226 Difference]: Without dead ends: 560 [2022-01-18 08:50:11,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=986, Unknown=1, NotChecked=66, Total=1260 [2022-01-18 08:50:11,796 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 281 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:11,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 1041 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 347 Invalid, 0 Unknown, 215 Unchecked, 0.1s Time] [2022-01-18 08:50:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-01-18 08:50:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 362. [2022-01-18 08:50:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.7756232686980609) internal successors, (641), 361 states have internal predecessors, (641), 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-01-18 08:50:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 641 transitions. [2022-01-18 08:50:11,803 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 641 transitions. Word has length 58 [2022-01-18 08:50:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:11,803 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 641 transitions. [2022-01-18 08:50:11,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-01-18 08:50:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 641 transitions. [2022-01-18 08:50:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-18 08:50:11,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:11,804 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:11,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 08:50:12,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:12,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash 813032059, now seen corresponding path program 1 times [2022-01-18 08:50:12,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:12,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641108907] [2022-01-18 08:50:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:12,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:12,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:12,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641108907] [2022-01-18 08:50:12,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641108907] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:12,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178512317] [2022-01-18 08:50:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:12,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:12,296 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-01-18 08:50:12,297 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-01-18 08:50:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:12,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 08:50:12,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:12,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:12,497 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:50:12,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:50:12,515 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 6 treesize of output 5 [2022-01-18 08:50:12,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 19 [2022-01-18 08:50:12,672 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:12,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-01-18 08:50:12,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:12,729 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 14 treesize of output 16 [2022-01-18 08:50:12,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 08:50:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:12,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:12,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_116 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2022-01-18 08:50:12,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:50:13,724 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:13,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:50:13,741 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:13,741 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2022-01-18 08:50:13,745 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 65 treesize of output 57 [2022-01-18 08:50:13,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 50 [2022-01-18 08:50:13,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 48 [2022-01-18 08:50:13,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 46 [2022-01-18 08:50:14,634 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:14,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 48 [2022-01-18 08:50:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 7 times theorem prover too weak. 3 trivial. 4 not checked. [2022-01-18 08:50:14,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178512317] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:14,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:14,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2022-01-18 08:50:14,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603230968] [2022-01-18 08:50:14,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:14,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 08:50:14,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 08:50:14,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=637, Unknown=20, NotChecked=106, Total=870 [2022-01-18 08:50:14,712 INFO L87 Difference]: Start difference. First operand 362 states and 641 transitions. Second operand has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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-01-18 08:50:15,080 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0))))) (= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_116 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2022-01-18 08:50:15,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0))))) (= 3 .cse1) (= .cse1 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|))) is different from false [2022-01-18 08:50:15,242 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0))))) (= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:50:15,353 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 c_~top~0) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0)))))) is different from false [2022-01-18 08:50:15,498 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_116 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem3#1|)) is different from false [2022-01-18 08:50:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:15,505 INFO L93 Difference]: Finished difference Result 873 states and 1579 transitions. [2022-01-18 08:50:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-18 08:50:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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) Word has length 86 [2022-01-18 08:50:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:15,509 INFO L225 Difference]: With dead ends: 873 [2022-01-18 08:50:15,509 INFO L226 Difference]: Without dead ends: 799 [2022-01-18 08:50:15,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 159 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=344, Invalid=1979, Unknown=57, NotChecked=700, Total=3080 [2022-01-18 08:50:15,510 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 410 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:15,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 1727 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 500 Invalid, 0 Unknown, 1176 Unchecked, 0.2s Time] [2022-01-18 08:50:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-01-18 08:50:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 662. [2022-01-18 08:50:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.8078668683812404) internal successors, (1195), 661 states have internal predecessors, (1195), 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-01-18 08:50:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1195 transitions. [2022-01-18 08:50:15,522 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1195 transitions. Word has length 86 [2022-01-18 08:50:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:15,522 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 1195 transitions. [2022-01-18 08:50:15,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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-01-18 08:50:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1195 transitions. [2022-01-18 08:50:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-18 08:50:15,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:15,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:15,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-18 08:50:15,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-18 08:50:15,760 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1444607871, now seen corresponding path program 2 times [2022-01-18 08:50:15,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312873842] [2022-01-18 08:50:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:15,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 08:50:15,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:15,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312873842] [2022-01-18 08:50:15,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312873842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:15,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898238962] [2022-01-18 08:50:15,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:50:15,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:15,965 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-01-18 08:50:15,967 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-01-18 08:50:16,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 08:50:16,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:50:16,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-18 08:50:16,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:16,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:16,128 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:50:16,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:50:16,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:50:16,242 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:16,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:16,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:16,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-18 08:50:16,342 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 15 treesize of output 17 [2022-01-18 08:50:16,384 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 16 treesize of output 8 [2022-01-18 08:50:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 08:50:16,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:16,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_172) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:50:16,442 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_172 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_172) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (= 0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|)) is different from false [2022-01-18 08:50:16,449 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_172 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_172) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:50:16,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:16,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 45 [2022-01-18 08:50:16,478 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 32 treesize of output 24 [2022-01-18 08:50:16,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:50:16,487 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 8 treesize of output 4 [2022-01-18 08:50:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2022-01-18 08:50:16,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898238962] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:16,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:16,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 11] total 27 [2022-01-18 08:50:16,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389196823] [2022-01-18 08:50:16,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:16,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 08:50:16,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 08:50:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=469, Unknown=3, NotChecked=138, Total=702 [2022-01-18 08:50:16,633 INFO L87 Difference]: Start difference. First operand 662 states and 1195 transitions. Second operand has 27 states, 27 states have (on average 7.111111111111111) internal successors, (192), 27 states have internal predecessors, (192), 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-01-18 08:50:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:17,146 INFO L93 Difference]: Finished difference Result 658 states and 1189 transitions. [2022-01-18 08:50:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-18 08:50:17,146 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.111111111111111) internal successors, (192), 27 states have internal predecessors, (192), 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) Word has length 86 [2022-01-18 08:50:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:17,147 INFO L225 Difference]: With dead ends: 658 [2022-01-18 08:50:17,147 INFO L226 Difference]: Without dead ends: 0 [2022-01-18 08:50:17,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1216, Unknown=3, NotChecked=234, Total=1806 [2022-01-18 08:50:17,148 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 337 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:17,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1058 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 367 Invalid, 0 Unknown, 277 Unchecked, 0.2s Time] [2022-01-18 08:50:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-18 08:50:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-18 08:50:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-01-18 08:50:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-18 08:50:17,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2022-01-18 08:50:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:17,150 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-18 08:50:17,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.111111111111111) internal successors, (192), 27 states have internal predecessors, (192), 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-01-18 08:50:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-18 08:50:17,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-18 08:50:17,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-18 08:50:17,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-18 08:50:17,174 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-01-18 08:50:17,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:17,373 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-01-18 08:50:17,374 INFO L308 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2022-01-18 08:50:17,377 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-18 08:50:17,377 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=FINITE_AUTOMATA, 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 [2022-01-18 08:50:17,377 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-18 08:50:17,378 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 79 transitions, 163 flow [2022-01-18 08:50:17,385 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 366 states, 364 states have (on average 1.9203296703296704) internal successors, (699), 365 states have internal predecessors, (699), 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-01-18 08:50:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 364 states have (on average 1.9203296703296704) internal successors, (699), 365 states have internal predecessors, (699), 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-01-18 08:50:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-18 08:50:17,386 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:17,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:17,386 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 08:50:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1475979099, now seen corresponding path program 1 times [2022-01-18 08:50:17,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:17,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416703945] [2022-01-18 08:50:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:17,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 08:50:17,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 08:50:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 08:50:17,405 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 08:50:17,405 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 08:50:17,405 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-18 08:50:17,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 08:50:17,405 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-18 08:50:17,406 INFO L308 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-18 08:50:17,406 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-18 08:50:17,406 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,415 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,438 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,439 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,440 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:50:17,441 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 08:50:17,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 08:50:17,442 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=FINITE_AUTOMATA, 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 [2022-01-18 08:50:17,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-18 08:50:17,443 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 127 transitions, 266 flow [2022-01-18 08:50:17,866 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26386 states, 26378 states have (on average 3.1626355296080066) internal successors, (83424), 26385 states have internal predecessors, (83424), 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-01-18 08:50:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 26386 states, 26378 states have (on average 3.1626355296080066) internal successors, (83424), 26385 states have internal predecessors, (83424), 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-01-18 08:50:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-18 08:50:17,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:17,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:17,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1538205864, now seen corresponding path program 1 times [2022-01-18 08:50:17,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:17,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290276103] [2022-01-18 08:50:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:17,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:50:17,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:17,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290276103] [2022-01-18 08:50:17,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290276103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:17,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:17,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 08:50:17,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637773337] [2022-01-18 08:50:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:17,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 08:50:17,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:17,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 08:50:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 08:50:18,003 INFO L87 Difference]: Start difference. First operand has 26386 states, 26378 states have (on average 3.1626355296080066) internal successors, (83424), 26385 states have internal predecessors, (83424), 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) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-18 08:50:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:18,111 INFO L93 Difference]: Finished difference Result 12144 states and 34944 transitions. [2022-01-18 08:50:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 08:50:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) Word has length 46 [2022-01-18 08:50:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:18,170 INFO L225 Difference]: With dead ends: 12144 [2022-01-18 08:50:18,170 INFO L226 Difference]: Without dead ends: 12088 [2022-01-18 08:50:18,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 08:50:18,172 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 99 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:18,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 411 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:50:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12088 states. [2022-01-18 08:50:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12088 to 12088. [2022-01-18 08:50:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12088 states, 12085 states have (on average 2.878196110881258) internal successors, (34783), 12087 states have internal predecessors, (34783), 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-01-18 08:50:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12088 states to 12088 states and 34783 transitions. [2022-01-18 08:50:18,581 INFO L78 Accepts]: Start accepts. Automaton has 12088 states and 34783 transitions. Word has length 46 [2022-01-18 08:50:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:18,581 INFO L470 AbstractCegarLoop]: Abstraction has 12088 states and 34783 transitions. [2022-01-18 08:50:18,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-18 08:50:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 12088 states and 34783 transitions. [2022-01-18 08:50:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-18 08:50:18,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:18,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:18,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 08:50:18,587 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -346194495, now seen corresponding path program 1 times [2022-01-18 08:50:18,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:18,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297329891] [2022-01-18 08:50:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:18,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 08:50:18,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297329891] [2022-01-18 08:50:18,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297329891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:18,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:18,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 08:50:18,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881865951] [2022-01-18 08:50:18,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:18,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 08:50:18,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 08:50:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 08:50:18,712 INFO L87 Difference]: Start difference. First operand 12088 states and 34783 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-01-18 08:50:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:19,165 INFO L93 Difference]: Finished difference Result 34823 states and 100455 transitions. [2022-01-18 08:50:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 08:50:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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) Word has length 52 [2022-01-18 08:50:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:19,330 INFO L225 Difference]: With dead ends: 34823 [2022-01-18 08:50:19,330 INFO L226 Difference]: Without dead ends: 34701 [2022-01-18 08:50:19,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-18 08:50:19,331 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 278 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:19,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1601 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 08:50:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34701 states. [2022-01-18 08:50:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34701 to 26451. [2022-01-18 08:50:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26451 states, 26448 states have (on average 2.906949485783424) internal successors, (76883), 26450 states have internal predecessors, (76883), 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-01-18 08:50:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26451 states to 26451 states and 76883 transitions. [2022-01-18 08:50:20,073 INFO L78 Accepts]: Start accepts. Automaton has 26451 states and 76883 transitions. Word has length 52 [2022-01-18 08:50:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:20,088 INFO L470 AbstractCegarLoop]: Abstraction has 26451 states and 76883 transitions. [2022-01-18 08:50:20,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-01-18 08:50:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26451 states and 76883 transitions. [2022-01-18 08:50:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-18 08:50:20,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:20,096 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:20,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 08:50:20,096 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1576202355, now seen corresponding path program 1 times [2022-01-18 08:50:20,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643874909] [2022-01-18 08:50:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:20,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:50:20,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:20,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643874909] [2022-01-18 08:50:20,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643874909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:20,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:20,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 08:50:20,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945059235] [2022-01-18 08:50:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:20,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 08:50:20,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 08:50:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 08:50:20,124 INFO L87 Difference]: Start difference. First operand 26451 states and 76883 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-01-18 08:50:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:20,301 INFO L93 Difference]: Finished difference Result 25267 states and 72643 transitions. [2022-01-18 08:50:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 08:50:20,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) Word has length 53 [2022-01-18 08:50:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:20,359 INFO L225 Difference]: With dead ends: 25267 [2022-01-18 08:50:20,360 INFO L226 Difference]: Without dead ends: 23971 [2022-01-18 08:50:20,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-18 08:50:20,360 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:20,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 399 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 08:50:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23971 states. [2022-01-18 08:50:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23971 to 18056. [2022-01-18 08:50:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18056 states, 18053 states have (on average 2.869495374729962) internal successors, (51803), 18055 states have internal predecessors, (51803), 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-01-18 08:50:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18056 states to 18056 states and 51803 transitions. [2022-01-18 08:50:20,738 INFO L78 Accepts]: Start accepts. Automaton has 18056 states and 51803 transitions. Word has length 53 [2022-01-18 08:50:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:20,738 INFO L470 AbstractCegarLoop]: Abstraction has 18056 states and 51803 transitions. [2022-01-18 08:50:20,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-01-18 08:50:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18056 states and 51803 transitions. [2022-01-18 08:50:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-18 08:50:20,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:20,844 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:20,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 08:50:20,844 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1438558693, now seen corresponding path program 1 times [2022-01-18 08:50:20,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456505370] [2022-01-18 08:50:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:20,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:20,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456505370] [2022-01-18 08:50:20,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456505370] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825892520] [2022-01-18 08:50:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:20,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:20,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:20,966 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-01-18 08:50:20,967 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-01-18 08:50:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:21,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 08:50:21,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:21,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:21,125 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:21,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:21,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:21,241 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 14 treesize of output 16 [2022-01-18 08:50:21,284 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 15 treesize of output 7 [2022-01-18 08:50:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:50:21,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:21,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_250 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_250) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:50:21,354 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:21,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:21,360 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:21,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:21,377 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 24 treesize of output 20 [2022-01-18 08:50:21,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-18 08:50:21,388 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 36 treesize of output 28 [2022-01-18 08:50:21,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-18 08:50:21,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:50:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-01-18 08:50:21,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825892520] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:21,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:21,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-18 08:50:21,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972248469] [2022-01-18 08:50:21,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:21,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 08:50:21,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 08:50:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2022-01-18 08:50:21,682 INFO L87 Difference]: Start difference. First operand 18056 states and 51803 transitions. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-01-18 08:50:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:23,425 INFO L93 Difference]: Finished difference Result 88530 states and 252568 transitions. [2022-01-18 08:50:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-18 08:50:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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) Word has length 58 [2022-01-18 08:50:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:23,836 INFO L225 Difference]: With dead ends: 88530 [2022-01-18 08:50:23,836 INFO L226 Difference]: Without dead ends: 87704 [2022-01-18 08:50:23,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=531, Invalid=3254, Unknown=1, NotChecked=120, Total=3906 [2022-01-18 08:50:23,837 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1808 mSDsluCounter, 5380 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 5367 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:23,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1808 Valid, 5367 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1764 Invalid, 0 Unknown, 826 Unchecked, 0.7s Time] [2022-01-18 08:50:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87704 states. [2022-01-18 08:50:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87704 to 24023. [2022-01-18 08:50:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24023 states, 24020 states have (on average 2.8860949208992506) internal successors, (69324), 24022 states have internal predecessors, (69324), 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-01-18 08:50:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24023 states to 24023 states and 69324 transitions. [2022-01-18 08:50:25,042 INFO L78 Accepts]: Start accepts. Automaton has 24023 states and 69324 transitions. Word has length 58 [2022-01-18 08:50:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:25,043 INFO L470 AbstractCegarLoop]: Abstraction has 24023 states and 69324 transitions. [2022-01-18 08:50:25,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-01-18 08:50:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 24023 states and 69324 transitions. [2022-01-18 08:50:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-18 08:50:25,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:25,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:25,094 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-01-18 08:50:25,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:25,291 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2027890772, now seen corresponding path program 1 times [2022-01-18 08:50:25,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313862982] [2022-01-18 08:50:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:25,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:50:25,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:25,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313862982] [2022-01-18 08:50:25,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313862982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:50:25,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 08:50:25,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 08:50:25,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464769315] [2022-01-18 08:50:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:50:25,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 08:50:25,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:25,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 08:50:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 08:50:25,356 INFO L87 Difference]: Start difference. First operand 24023 states and 69324 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-18 08:50:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:25,775 INFO L93 Difference]: Finished difference Result 47384 states and 136159 transitions. [2022-01-18 08:50:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 08:50:25,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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) Word has length 59 [2022-01-18 08:50:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:25,881 INFO L225 Difference]: With dead ends: 47384 [2022-01-18 08:50:25,882 INFO L226 Difference]: Without dead ends: 46600 [2022-01-18 08:50:25,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-18 08:50:25,882 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 301 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:25,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 1398 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 08:50:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46600 states. [2022-01-18 08:50:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46600 to 28865. [2022-01-18 08:50:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28865 states, 28862 states have (on average 2.894636546323886) internal successors, (83545), 28864 states have internal predecessors, (83545), 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-01-18 08:50:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28865 states to 28865 states and 83545 transitions. [2022-01-18 08:50:26,619 INFO L78 Accepts]: Start accepts. Automaton has 28865 states and 83545 transitions. Word has length 59 [2022-01-18 08:50:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:26,620 INFO L470 AbstractCegarLoop]: Abstraction has 28865 states and 83545 transitions. [2022-01-18 08:50:26,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-18 08:50:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28865 states and 83545 transitions. [2022-01-18 08:50:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 08:50:26,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:26,645 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:26,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 08:50:26,646 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 571330490, now seen corresponding path program 2 times [2022-01-18 08:50:26,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118976308] [2022-01-18 08:50:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:26,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:26,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:26,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118976308] [2022-01-18 08:50:26,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118976308] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:26,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627794484] [2022-01-18 08:50:26,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:50:26,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:26,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:26,752 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-01-18 08:50:26,753 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-01-18 08:50:26,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:50:26,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:50:26,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 08:50:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:26,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:26,928 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:26,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:26,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:26,978 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 14 treesize of output 16 [2022-01-18 08:50:27,025 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 15 treesize of output 7 [2022-01-18 08:50:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:27,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:27,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_304) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:50:27,094 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:27,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:27,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:27,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:27,115 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 8 treesize of output 4 [2022-01-18 08:50:27,124 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 37 treesize of output 29 [2022-01-18 08:50:27,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:50:27,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:50:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:50:27,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627794484] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:27,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:27,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-18 08:50:27,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833988727] [2022-01-18 08:50:27,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:27,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 08:50:27,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 08:50:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2022-01-18 08:50:27,684 INFO L87 Difference]: Start difference. First operand 28865 states and 83545 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 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-01-18 08:50:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:29,639 INFO L93 Difference]: Finished difference Result 104351 states and 298865 transitions. [2022-01-18 08:50:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 08:50:29,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 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) Word has length 65 [2022-01-18 08:50:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:29,877 INFO L225 Difference]: With dead ends: 104351 [2022-01-18 08:50:29,877 INFO L226 Difference]: Without dead ends: 103595 [2022-01-18 08:50:29,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=678, Invalid=4875, Unknown=1, NotChecked=146, Total=5700 [2022-01-18 08:50:29,880 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 1732 mSDsluCounter, 6554 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 6711 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1025 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:29,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1732 Valid, 6711 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2217 Invalid, 0 Unknown, 1025 Unchecked, 0.8s Time] [2022-01-18 08:50:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103595 states. [2022-01-18 08:50:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103595 to 35853. [2022-01-18 08:50:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35853 states, 35850 states have (on average 2.922594142259414) internal successors, (104775), 35852 states have internal predecessors, (104775), 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-01-18 08:50:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35853 states to 35853 states and 104775 transitions. [2022-01-18 08:50:31,403 INFO L78 Accepts]: Start accepts. Automaton has 35853 states and 104775 transitions. Word has length 65 [2022-01-18 08:50:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:31,404 INFO L470 AbstractCegarLoop]: Abstraction has 35853 states and 104775 transitions. [2022-01-18 08:50:31,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 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-01-18 08:50:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35853 states and 104775 transitions. [2022-01-18 08:50:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-18 08:50:31,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:31,431 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:31,447 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-01-18 08:50:31,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 08:50:31,632 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 479879497, now seen corresponding path program 1 times [2022-01-18 08:50:31,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156097926] [2022-01-18 08:50:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:31,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:31,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:31,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156097926] [2022-01-18 08:50:31,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156097926] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:31,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035463223] [2022-01-18 08:50:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:31,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:31,783 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-01-18 08:50:31,784 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-01-18 08:50:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:31,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 08:50:31,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:31,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:31,987 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:50:31,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:50:32,004 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:32,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:32,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:32,082 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 21 treesize of output 21 [2022-01-18 08:50:32,156 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 15 treesize of output 7 [2022-01-18 08:50:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:32,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:32,227 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (forall ((v_ArrVal_348 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_348) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-18 08:50:32,233 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_348 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_348) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:50:32,249 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:32,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:32,255 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:32,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:32,269 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 8 treesize of output 4 [2022-01-18 08:50:32,275 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 44 treesize of output 32 [2022-01-18 08:50:32,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:50:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:50:32,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035463223] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:32,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:32,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2022-01-18 08:50:32,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980881163] [2022-01-18 08:50:32,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:32,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 08:50:32,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 08:50:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=348, Unknown=2, NotChecked=78, Total=506 [2022-01-18 08:50:32,437 INFO L87 Difference]: Start difference. First operand 35853 states and 104775 transitions. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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-01-18 08:50:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:35,370 INFO L93 Difference]: Finished difference Result 128986 states and 369497 transitions. [2022-01-18 08:50:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-18 08:50:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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) Word has length 73 [2022-01-18 08:50:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:35,711 INFO L225 Difference]: With dead ends: 128986 [2022-01-18 08:50:35,712 INFO L226 Difference]: Without dead ends: 128160 [2022-01-18 08:50:35,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1026, Invalid=7722, Unknown=2, NotChecked=370, Total=9120 [2022-01-18 08:50:35,714 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1614 mSDsluCounter, 7892 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 7995 SdHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1383 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:35,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1614 Valid, 7995 Invalid, 4432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2941 Invalid, 0 Unknown, 1383 Unchecked, 1.4s Time] [2022-01-18 08:50:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128160 states. [2022-01-18 08:50:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128160 to 38503. [2022-01-18 08:50:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38503 states, 38500 states have (on average 2.9295324675324674) internal successors, (112787), 38502 states have internal predecessors, (112787), 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-01-18 08:50:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38503 states to 38503 states and 112787 transitions. [2022-01-18 08:50:37,578 INFO L78 Accepts]: Start accepts. Automaton has 38503 states and 112787 transitions. Word has length 73 [2022-01-18 08:50:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:37,578 INFO L470 AbstractCegarLoop]: Abstraction has 38503 states and 112787 transitions. [2022-01-18 08:50:37,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 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-01-18 08:50:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38503 states and 112787 transitions. [2022-01-18 08:50:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 08:50:37,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:37,602 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:37,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 08:50:37,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:37,818 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash 174224648, now seen corresponding path program 1 times [2022-01-18 08:50:37,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:37,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671449773] [2022-01-18 08:50:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:37,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:37,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:37,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671449773] [2022-01-18 08:50:37,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671449773] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044717127] [2022-01-18 08:50:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:37,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:37,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:37,964 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-01-18 08:50:37,965 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-01-18 08:50:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:38,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-18 08:50:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:38,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:38,176 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:50:38,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:50:38,210 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:38,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:38,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:38,298 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:50:38,298 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 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-18 08:50:38,339 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 08:50:38,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2022-01-18 08:50:38,443 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 23 treesize of output 11 [2022-01-18 08:50:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:38,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:38,538 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (forall ((v_ArrVal_403 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-18 08:50:38,573 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| v_ArrVal_402) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_403 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2022-01-18 08:50:38,586 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| v_ArrVal_402) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_403 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:50:38,603 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:38,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:38,609 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:38,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:38,623 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 8 treesize of output 4 [2022-01-18 08:50:38,674 INFO L353 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2022-01-18 08:50:38,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 171 [2022-01-18 08:50:38,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 139 treesize of output 137 [2022-01-18 08:50:38,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 133 [2022-01-18 08:50:38,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:38,696 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 175 treesize of output 174 [2022-01-18 08:50:38,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 142 treesize of output 140 [2022-01-18 08:50:38,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 140 treesize of output 138 [2022-01-18 08:50:38,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 138 treesize of output 134 [2022-01-18 08:50:41,833 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:41,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 92 [2022-01-18 08:50:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:50:41,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044717127] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:41,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:41,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-01-18 08:50:41,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828441919] [2022-01-18 08:50:41,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:41,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 08:50:41,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:41,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 08:50:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=598, Unknown=3, NotChecked=156, Total=870 [2022-01-18 08:50:41,891 INFO L87 Difference]: Start difference. First operand 38503 states and 112787 transitions. Second operand has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:50:43,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (+ c_~next_alloc_idx~0 2) 0))) (.cse2 (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (.cse0 (<= c_~next_alloc_idx~0 62))) (and .cse0 (or .cse1 (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (not .cse2) .cse1 (or (let ((.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| v_ArrVal_402) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse3)) (or .cse3 (forall ((v_ArrVal_403 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) .cse2) (or (= c_~next_alloc_idx~0 0) (and .cse0 (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)))))) is different from false [2022-01-18 08:50:45,386 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)) (.cse3 (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (let ((.cse0 (not .cse3)) (.cse1 (= .cse4 0))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) .cse0 (or .cse0 .cse1) (or (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) .cse1) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (or (let ((.cse2 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| v_ArrVal_402) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse2)) (or .cse2 (forall ((v_ArrVal_403 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) .cse1) (or (<= c_~next_alloc_idx~0 3) .cse3) (= .cse4 1)))) is different from false [2022-01-18 08:50:47,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (let ((.cse2 (not .cse4)) (.cse1 (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0)) (.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or .cse1 (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|))) (or .cse1 .cse2) .cse2 (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (or .cse1 (let ((.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| v_ArrVal_402) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse3)) (or .cse3 (forall ((v_ArrVal_403 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_403) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))))))) (or (<= c_~next_alloc_idx~0 3) .cse4) (= .cse0 1)))) is different from false [2022-01-18 08:50:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:50:51,542 INFO L93 Difference]: Finished difference Result 61112 states and 176387 transitions. [2022-01-18 08:50:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 08:50:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-01-18 08:50:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:50:51,660 INFO L225 Difference]: With dead ends: 61112 [2022-01-18 08:50:51,660 INFO L226 Difference]: Without dead ends: 60846 [2022-01-18 08:50:51,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=441, Invalid=3116, Unknown=7, NotChecked=726, Total=4290 [2022-01-18 08:50:51,662 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 1123 mSDsluCounter, 6781 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 6886 SdHoareTripleChecker+Invalid, 4757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2719 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 08:50:51,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1123 Valid, 6886 Invalid, 4757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1980 Invalid, 0 Unknown, 2719 Unchecked, 0.9s Time] [2022-01-18 08:50:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60846 states. [2022-01-18 08:50:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60846 to 38666. [2022-01-18 08:50:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38666 states, 38663 states have (on average 2.9294674494995214) internal successors, (113262), 38665 states have internal predecessors, (113262), 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-01-18 08:50:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38666 states to 38666 states and 113262 transitions. [2022-01-18 08:50:52,562 INFO L78 Accepts]: Start accepts. Automaton has 38666 states and 113262 transitions. Word has length 75 [2022-01-18 08:50:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:50:52,563 INFO L470 AbstractCegarLoop]: Abstraction has 38666 states and 113262 transitions. [2022-01-18 08:50:52,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:50:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 38666 states and 113262 transitions. [2022-01-18 08:50:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 08:50:52,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:50:52,590 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:50:52,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-18 08:50:52,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:52,804 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:50:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:50:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1573449434, now seen corresponding path program 2 times [2022-01-18 08:50:52,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:50:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031579059] [2022-01-18 08:50:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:50:52,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:50:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:50:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:53,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:50:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031579059] [2022-01-18 08:50:53,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031579059] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:50:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942248769] [2022-01-18 08:50:53,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:50:53,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:50:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:50:53,040 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-01-18 08:50:53,067 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-01-18 08:50:53,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:50:53,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:50:53,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-18 08:50:53,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:50:53,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:50:53,279 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:50:53,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:50:53,317 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:53,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:50:53,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:50:53,407 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:50:53,408 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 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-18 08:50:53,479 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-18 08:50:53,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2022-01-18 08:50:53,560 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 23 treesize of output 11 [2022-01-18 08:50:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:50:53,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:50:53,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:50:53,634 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (forall ((v_ArrVal_458 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-18 08:50:53,667 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((v_ArrVal_458 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| v_ArrVal_457) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0))))) is different from false [2022-01-18 08:50:53,680 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((v_ArrVal_458 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| v_ArrVal_457) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:50:53,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:53,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:50:53,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:53,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:50:53,748 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 8 treesize of output 4 [2022-01-18 08:50:53,790 INFO L353 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2022-01-18 08:50:53,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 171 [2022-01-18 08:50:53,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 139 treesize of output 135 [2022-01-18 08:50:53,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 135 treesize of output 133 [2022-01-18 08:50:53,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:50:53,806 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 175 treesize of output 174 [2022-01-18 08:50:53,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 142 treesize of output 140 [2022-01-18 08:50:53,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 140 treesize of output 136 [2022-01-18 08:50:53,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 136 treesize of output 134 [2022-01-18 08:50:56,757 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:50:56,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 92 [2022-01-18 08:50:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:50:56,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942248769] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:50:56,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:50:56,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-01-18 08:50:56,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961296917] [2022-01-18 08:50:56,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:50:56,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 08:50:56,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:50:56,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 08:50:56,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=557, Unknown=4, NotChecked=204, Total=870 [2022-01-18 08:50:56,802 INFO L87 Difference]: Start difference. First operand 38666 states and 113262 transitions. Second operand has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:50:58,892 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ c_~next_alloc_idx~0 2) 0))) (.cse0 (<= c_~next_alloc_idx~0 62)) (.cse1 (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse3 (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (and .cse0 .cse1 (or .cse2 (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (not .cse3) .cse2 (or (= c_~next_alloc_idx~0 0) (and .cse0 .cse1)) (or (let ((.cse4 (< 64 c_~next_alloc_idx~0))) (and (or .cse4 (forall ((v_ArrVal_458 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| v_ArrVal_457) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse4)))) .cse3))) is different from false [2022-01-18 08:50:59,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse0 (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (= .cse2 0))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) .cse0 (or .cse0 .cse1) (or (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) .cse1) (<= c_~next_alloc_idx~0 3) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= .cse2 1) (or (let ((.cse3 (< 64 c_~next_alloc_idx~0))) (and (or .cse3 (forall ((v_ArrVal_458 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| v_ArrVal_457) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse3)))) .cse1)))) is different from false [2022-01-18 08:51:01,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0)) (.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or .cse1 (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|))) (or .cse1 .cse2) .cse2 (<= c_~next_alloc_idx~0 3) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (or .cse1 (let ((.cse3 (< 64 c_~next_alloc_idx~0))) (and (or .cse3 (forall ((v_ArrVal_458 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_11| v_ArrVal_457) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse3))))) (= .cse0 1))) is different from false [2022-01-18 08:51:10,396 WARN L228 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 40 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 08:51:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:10,942 INFO L93 Difference]: Finished difference Result 60844 states and 175874 transitions. [2022-01-18 08:51:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 08:51:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-01-18 08:51:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:11,060 INFO L225 Difference]: With dead ends: 60844 [2022-01-18 08:51:11,060 INFO L226 Difference]: Without dead ends: 60578 [2022-01-18 08:51:11,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=381, Invalid=2831, Unknown=8, NotChecked=812, Total=4032 [2022-01-18 08:51:11,062 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 970 mSDsluCounter, 6190 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 6265 SdHoareTripleChecker+Invalid, 6936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5203 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:11,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 6265 Invalid, 6936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1682 Invalid, 0 Unknown, 5203 Unchecked, 0.7s Time] [2022-01-18 08:51:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60578 states. [2022-01-18 08:51:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60578 to 38679. [2022-01-18 08:51:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38679 states, 38676 states have (on average 2.929491157306857) internal successors, (113301), 38678 states have internal predecessors, (113301), 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-01-18 08:51:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38679 states to 38679 states and 113301 transitions. [2022-01-18 08:51:11,952 INFO L78 Accepts]: Start accepts. Automaton has 38679 states and 113301 transitions. Word has length 75 [2022-01-18 08:51:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:51:11,952 INFO L470 AbstractCegarLoop]: Abstraction has 38679 states and 113301 transitions. [2022-01-18 08:51:11,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 08:51:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38679 states and 113301 transitions. [2022-01-18 08:51:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 08:51:11,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:51:11,977 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:51:11,995 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-01-18 08:51:12,183 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,SelfDestructingSolverStorable14 [2022-01-18 08:51:12,184 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:51:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:51:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1093244066, now seen corresponding path program 3 times [2022-01-18 08:51:12,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:51:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88145394] [2022-01-18 08:51:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:12,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:51:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:12,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:51:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88145394] [2022-01-18 08:51:12,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88145394] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:51:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619279377] [2022-01-18 08:51:12,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:51:12,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:51:12,367 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-01-18 08:51:12,371 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-01-18 08:51:12,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 08:51:12,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:51:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 08:51:12,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:51:12,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:51:12,569 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 08:51:12,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 08:51:12,608 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 08:51:12,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 08:51:12,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 08:51:12,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 08:51:12,699 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 14 treesize of output 16 [2022-01-18 08:51:12,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 08:51:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:51:12,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_512) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:51:12,818 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_512) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_512) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:51:12,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:12,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:51:12,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:12,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:51:12,860 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 8 treesize of output 4 [2022-01-18 08:51:12,868 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 217 treesize of output 201 [2022-01-18 08:51:12,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 176 treesize of output 172 [2022-01-18 08:51:12,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 172 treesize of output 170 [2022-01-18 08:51:12,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 170 treesize of output 162 [2022-01-18 08:51:12,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 162 treesize of output 158 [2022-01-18 08:51:13,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 11 [2022-01-18 08:51:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:51:13,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619279377] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:51:13,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:51:13,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-18 08:51:13,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14302136] [2022-01-18 08:51:13,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:51:13,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:51:13,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:51:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:51:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=467, Unknown=2, NotChecked=90, Total=650 [2022-01-18 08:51:13,683 INFO L87 Difference]: Start difference. First operand 38679 states and 113301 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-01-18 08:51:14,007 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_512) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_512) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:51:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:15,848 INFO L93 Difference]: Finished difference Result 115324 states and 332097 transitions. [2022-01-18 08:51:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-18 08:51:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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) Word has length 75 [2022-01-18 08:51:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:16,102 INFO L225 Difference]: With dead ends: 115324 [2022-01-18 08:51:16,102 INFO L226 Difference]: Without dead ends: 114834 [2022-01-18 08:51:16,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=5610, Unknown=3, NotChecked=480, Total=6972 [2022-01-18 08:51:16,105 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 1471 mSDsluCounter, 8131 mSDsCounter, 0 mSdLazyCounter, 3222 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 8153 SdHoareTripleChecker+Invalid, 5954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2635 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:16,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 8153 Invalid, 5954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3222 Invalid, 0 Unknown, 2635 Unchecked, 1.0s Time] [2022-01-18 08:51:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114834 states. [2022-01-18 08:51:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114834 to 40891. [2022-01-18 08:51:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40891 states, 40888 states have (on average 2.932596360790452) internal successors, (119908), 40890 states have internal predecessors, (119908), 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-01-18 08:51:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40891 states to 40891 states and 119908 transitions. [2022-01-18 08:51:17,410 INFO L78 Accepts]: Start accepts. Automaton has 40891 states and 119908 transitions. Word has length 75 [2022-01-18 08:51:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:51:17,410 INFO L470 AbstractCegarLoop]: Abstraction has 40891 states and 119908 transitions. [2022-01-18 08:51:17,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-01-18 08:51:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 40891 states and 119908 transitions. [2022-01-18 08:51:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 08:51:17,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:51:17,438 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:51:17,463 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-01-18 08:51:17,660 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,SelfDestructingSolverStorable15 [2022-01-18 08:51:17,660 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:51:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:51:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash 576663434, now seen corresponding path program 1 times [2022-01-18 08:51:17,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:51:17,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673092213] [2022-01-18 08:51:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:17,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:51:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:17,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:51:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673092213] [2022-01-18 08:51:17,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673092213] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:51:17,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854652600] [2022-01-18 08:51:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:17,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:51:17,762 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-01-18 08:51:17,765 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-01-18 08:51:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:17,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-18 08:51:17,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:51:17,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:51:18,271 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:51:18,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:51:18,282 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 6 treesize of output 5 [2022-01-18 08:51:18,295 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:18,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:51:18,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:51:18,335 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 14 treesize of output 16 [2022-01-18 08:51:18,388 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 15 treesize of output 7 [2022-01-18 08:51:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:18,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:51:18,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:18,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:51:18,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:18,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-18 08:51:18,554 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 33 treesize of output 25 [2022-01-18 08:51:19,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:51:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:19,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854652600] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:51:19,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:51:19,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 27 [2022-01-18 08:51:19,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544291936] [2022-01-18 08:51:19,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:51:19,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 08:51:19,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:51:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 08:51:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=603, Unknown=4, NotChecked=0, Total=702 [2022-01-18 08:51:19,154 INFO L87 Difference]: Start difference. First operand 40891 states and 119908 transitions. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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-01-18 08:51:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:29,735 INFO L93 Difference]: Finished difference Result 250421 states and 713988 transitions. [2022-01-18 08:51:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-01-18 08:51:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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) Word has length 75 [2022-01-18 08:51:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:30,459 INFO L225 Difference]: With dead ends: 250421 [2022-01-18 08:51:30,459 INFO L226 Difference]: Without dead ends: 239347 [2022-01-18 08:51:30,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 177 SyntacticMatches, 77 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 39207 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8268, Invalid=59630, Unknown=484, NotChecked=0, Total=68382 [2022-01-18 08:51:30,466 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 4099 mSDsluCounter, 17252 mSDsCounter, 0 mSdLazyCounter, 5173 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4099 SdHoareTripleChecker+Valid, 18220 SdHoareTripleChecker+Invalid, 10508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 5173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5036 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:30,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4099 Valid, 18220 Invalid, 10508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 5173 Invalid, 0 Unknown, 5036 Unchecked, 1.9s Time] [2022-01-18 08:51:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239347 states. [2022-01-18 08:51:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239347 to 78677. [2022-01-18 08:51:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78677 states, 78674 states have (on average 2.971019650710527) internal successors, (233742), 78676 states have internal predecessors, (233742), 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-01-18 08:51:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78677 states to 78677 states and 233742 transitions. [2022-01-18 08:51:34,249 INFO L78 Accepts]: Start accepts. Automaton has 78677 states and 233742 transitions. Word has length 75 [2022-01-18 08:51:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:51:34,250 INFO L470 AbstractCegarLoop]: Abstraction has 78677 states and 233742 transitions. [2022-01-18 08:51:34,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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-01-18 08:51:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 78677 states and 233742 transitions. [2022-01-18 08:51:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-18 08:51:34,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:51:34,304 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:51:34,321 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-01-18 08:51:34,515 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,SelfDestructingSolverStorable16 [2022-01-18 08:51:34,515 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:51:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:51:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1195469258, now seen corresponding path program 1 times [2022-01-18 08:51:34,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:51:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314618553] [2022-01-18 08:51:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:34,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:51:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:51:34,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:51:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314618553] [2022-01-18 08:51:34,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314618553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:51:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26769864] [2022-01-18 08:51:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:34,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:51:34,671 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-01-18 08:51:34,672 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-01-18 08:51:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:34,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 08:51:34,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:51:34,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:51:34,846 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:51:34,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:51:34,861 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 6 treesize of output 5 [2022-01-18 08:51:34,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:51:35,007 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:35,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:51:35,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:51:35,058 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 14 treesize of output 16 [2022-01-18 08:51:35,099 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 15 treesize of output 7 [2022-01-18 08:51:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:51:35,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:51:35,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:51:35,186 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:51:35,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_619 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| v_ArrVal_621) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0) 0))) .cse0))) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_619) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0)))) is different from false [2022-01-18 08:51:36,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:36,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:51:36,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:36,030 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-18 08:51:36,032 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 33 treesize of output 25 [2022-01-18 08:51:36,666 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:36,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 48 [2022-01-18 08:51:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 7 times theorem prover too weak. 3 trivial. 19 not checked. [2022-01-18 08:51:36,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26769864] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:51:36,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:51:36,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2022-01-18 08:51:36,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958828835] [2022-01-18 08:51:36,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:51:36,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 08:51:36,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:51:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 08:51:36,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=604, Unknown=4, NotChecked=156, Total=870 [2022-01-18 08:51:36,701 INFO L87 Difference]: Start difference. First operand 78677 states and 233742 transitions. Second operand has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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-01-18 08:51:38,126 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 c_~top~0) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_619 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| v_ArrVal_621) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0) 0))) .cse0))) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_619) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_45|) 0))))) is different from false [2022-01-18 08:51:39,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= c_~top~0 0)) (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:51:39,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_623 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_623) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:51:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:40,411 INFO L93 Difference]: Finished difference Result 215681 states and 633169 transitions. [2022-01-18 08:51:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-18 08:51:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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) Word has length 86 [2022-01-18 08:51:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:41,095 INFO L225 Difference]: With dead ends: 215681 [2022-01-18 08:51:41,096 INFO L226 Difference]: Without dead ends: 215345 [2022-01-18 08:51:41,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 168 SyntacticMatches, 19 SemanticMatches, 101 ConstructedPredicates, 6 IntricatePredicates, 9 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1077, Invalid=8178, Unknown=81, NotChecked=1170, Total=10506 [2022-01-18 08:51:41,102 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 2269 mSDsluCounter, 12498 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 12363 SdHoareTripleChecker+Invalid, 9190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6882 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:41,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2269 Valid, 12363 Invalid, 9190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2216 Invalid, 0 Unknown, 6882 Unchecked, 0.7s Time] [2022-01-18 08:51:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215345 states. [2022-01-18 08:51:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215345 to 87350. [2022-01-18 08:51:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87350 states, 87347 states have (on average 2.9740689434096192) internal successors, (259776), 87349 states have internal predecessors, (259776), 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-01-18 08:51:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87350 states to 87350 states and 259776 transitions. [2022-01-18 08:51:44,162 INFO L78 Accepts]: Start accepts. Automaton has 87350 states and 259776 transitions. Word has length 86 [2022-01-18 08:51:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:51:44,163 INFO L470 AbstractCegarLoop]: Abstraction has 87350 states and 259776 transitions. [2022-01-18 08:51:44,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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-01-18 08:51:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 87350 states and 259776 transitions. [2022-01-18 08:51:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-18 08:51:44,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:51:44,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:51:44,241 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-01-18 08:51:44,441 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,SelfDestructingSolverStorable17 [2022-01-18 08:51:44,441 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:51:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:51:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1551601942, now seen corresponding path program 2 times [2022-01-18 08:51:44,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:51:44,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331778941] [2022-01-18 08:51:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:44,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:51:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:51:44,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:51:44,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331778941] [2022-01-18 08:51:44,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331778941] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:51:44,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158768071] [2022-01-18 08:51:44,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:51:44,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:51:44,604 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-01-18 08:51:44,604 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-01-18 08:51:44,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 08:51:44,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:51:44,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-18 08:51:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:51:44,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:51:44,783 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:51:44,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:51:44,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:51:44,887 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:44,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:51:44,900 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 14 treesize of output 16 [2022-01-18 08:51:44,922 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 16 treesize of output 8 [2022-01-18 08:51:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 08:51:44,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:51:44,985 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| 0) (forall ((v_ArrVal_675 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_675) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-18 08:51:44,990 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 32 treesize of output 24 [2022-01-18 08:51:44,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:51:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-01-18 08:51:45,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158768071] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:51:45,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:51:45,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 22 [2022-01-18 08:51:45,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121470158] [2022-01-18 08:51:45,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:51:45,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-18 08:51:45,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:51:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-18 08:51:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-01-18 08:51:45,154 INFO L87 Difference]: Start difference. First operand 87350 states and 259776 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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-01-18 08:51:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:47,928 INFO L93 Difference]: Finished difference Result 208276 states and 613619 transitions. [2022-01-18 08:51:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-18 08:51:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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) Word has length 86 [2022-01-18 08:51:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:48,859 INFO L225 Difference]: With dead ends: 208276 [2022-01-18 08:51:48,859 INFO L226 Difference]: Without dead ends: 203432 [2022-01-18 08:51:48,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=797, Invalid=4036, Unknown=1, NotChecked=136, Total=4970 [2022-01-18 08:51:48,860 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 1821 mSDsluCounter, 5428 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 5437 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:48,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1821 Valid, 5437 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1953 Invalid, 0 Unknown, 772 Unchecked, 0.9s Time] [2022-01-18 08:51:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203432 states. [2022-01-18 08:51:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203432 to 90490. [2022-01-18 08:51:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90490 states, 90487 states have (on average 2.9850144219611656) internal successors, (270105), 90489 states have internal predecessors, (270105), 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-01-18 08:51:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90490 states to 90490 states and 270105 transitions. [2022-01-18 08:51:51,899 INFO L78 Accepts]: Start accepts. Automaton has 90490 states and 270105 transitions. Word has length 86 [2022-01-18 08:51:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:51:51,899 INFO L470 AbstractCegarLoop]: Abstraction has 90490 states and 270105 transitions. [2022-01-18 08:51:51,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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-01-18 08:51:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 90490 states and 270105 transitions. [2022-01-18 08:51:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 08:51:51,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:51:51,973 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:51:51,991 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-01-18 08:51:52,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:52,189 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:51:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:51:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash -292166807, now seen corresponding path program 1 times [2022-01-18 08:51:52,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:51:52,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536573642] [2022-01-18 08:51:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:52,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:51:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:52,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:51:52,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536573642] [2022-01-18 08:51:52,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536573642] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:51:52,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161621666] [2022-01-18 08:51:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:51:52,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:51:52,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:51:52,370 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-01-18 08:51:52,371 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-01-18 08:51:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:51:52,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 08:51:52,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:51:52,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:51:53,310 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:51:53,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:51:53,325 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 6 treesize of output 5 [2022-01-18 08:51:53,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:51:53,464 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:53,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:51:53,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:51:53,507 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 14 treesize of output 16 [2022-01-18 08:51:53,546 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 15 treesize of output 7 [2022-01-18 08:51:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:51:53,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:51:53,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:51:53,611 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:51:54,216 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:54,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:51:54,242 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:51:54,243 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-18 08:51:54,245 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 33 treesize of output 25 [2022-01-18 08:51:55,883 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:51:55,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 92 [2022-01-18 08:51:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:51:55,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161621666] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:51:55,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:51:55,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2022-01-18 08:51:55,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3375467] [2022-01-18 08:51:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:51:55,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 08:51:55,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:51:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 08:51:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=651, Unknown=14, NotChecked=106, Total=870 [2022-01-18 08:51:55,947 INFO L87 Difference]: Start difference. First operand 90490 states and 270105 transitions. Second operand has 30 states, 30 states have (on average 5.8) internal successors, (174), 30 states have internal predecessors, (174), 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-01-18 08:51:57,698 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) .cse0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| v_ArrVal_733) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) (not .cse0))))))) is different from false [2022-01-18 08:51:58,284 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~next_alloc_idx~0 62) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (forall ((v_ArrVal_730 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) .cse0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| v_ArrVal_733) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) (not .cse0)))) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_730) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0))))) is different from false [2022-01-18 08:51:58,328 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~next_alloc_idx~0 62) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (forall ((v_ArrVal_730 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) .cse0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46| v_ArrVal_733) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0) 0))) (not .cse0)))) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_730) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_46|) 0))))) is different from false [2022-01-18 08:51:58,833 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_734) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:51:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:51:59,555 INFO L93 Difference]: Finished difference Result 172855 states and 508163 transitions. [2022-01-18 08:51:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-01-18 08:51:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.8) internal successors, (174), 30 states have internal predecessors, (174), 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) Word has length 88 [2022-01-18 08:51:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:51:59,942 INFO L225 Difference]: With dead ends: 172855 [2022-01-18 08:51:59,942 INFO L226 Difference]: Without dead ends: 172407 [2022-01-18 08:51:59,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 178 SyntacticMatches, 15 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1072, Invalid=7827, Unknown=55, NotChecked=1146, Total=10100 [2022-01-18 08:51:59,943 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 1934 mSDsluCounter, 11006 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 11064 SdHoareTripleChecker+Invalid, 7553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4465 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 08:51:59,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1934 Valid, 11064 Invalid, 7553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2995 Invalid, 0 Unknown, 4465 Unchecked, 0.9s Time] [2022-01-18 08:52:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172407 states. [2022-01-18 08:52:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172407 to 94782. [2022-01-18 08:52:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94782 states, 94779 states have (on average 2.984226463668112) internal successors, (282842), 94781 states have internal predecessors, (282842), 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-01-18 08:52:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94782 states to 94782 states and 282842 transitions. [2022-01-18 08:52:02,445 INFO L78 Accepts]: Start accepts. Automaton has 94782 states and 282842 transitions. Word has length 88 [2022-01-18 08:52:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:02,446 INFO L470 AbstractCegarLoop]: Abstraction has 94782 states and 282842 transitions. [2022-01-18 08:52:02,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.8) internal successors, (174), 30 states have internal predecessors, (174), 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-01-18 08:52:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 94782 states and 282842 transitions. [2022-01-18 08:52:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 08:52:02,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:02,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:02,521 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-01-18 08:52:02,718 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,SelfDestructingSolverStorable19 [2022-01-18 08:52:02,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1710992523, now seen corresponding path program 2 times [2022-01-18 08:52:02,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:02,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296709791] [2022-01-18 08:52:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:02,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:52:02,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296709791] [2022-01-18 08:52:02,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296709791] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878777316] [2022-01-18 08:52:02,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:52:02,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:02,885 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-01-18 08:52:02,927 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-01-18 08:52:02,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:52:02,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:52:02,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 08:52:02,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:03,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:03,129 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:52:03,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:52:03,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 08:52:03,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:52:03,276 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:03,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:03,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:52:03,326 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 14 treesize of output 16 [2022-01-18 08:52:03,368 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 15 treesize of output 7 [2022-01-18 08:52:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-18 08:52:03,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:52:03,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:52:03,442 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:04,360 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:04,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:52:04,378 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:04,378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-18 08:52:04,381 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 33 treesize of output 25 [2022-01-18 08:52:05,629 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:05,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 48 [2022-01-18 08:52:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-01-18 08:52:05,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878777316] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:52:05,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:52:05,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 29 [2022-01-18 08:52:05,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900339791] [2022-01-18 08:52:05,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:52:05,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 08:52:05,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 08:52:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=596, Unknown=13, NotChecked=102, Total=812 [2022-01-18 08:52:05,669 INFO L87 Difference]: Start difference. First operand 94782 states and 282842 transitions. Second operand has 29 states, 29 states have (on average 6.0) internal successors, (174), 29 states have internal predecessors, (174), 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-01-18 08:52:05,730 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (forall ((v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:07,680 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49| Int) (v_ArrVal_789 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((v_ArrVal_793 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49|) 0))))) (or (forall ((v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49| v_ArrVal_790) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49|) 0) 0))) (not .cse0)))) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_789) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_49|) 0)))) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2022-01-18 08:52:07,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (or .cse0 (forall ((v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:08,252 INFO L93 Difference]: Finished difference Result 211328 states and 620514 transitions. [2022-01-18 08:52:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-18 08:52:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.0) internal successors, (174), 29 states have internal predecessors, (174), 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) Word has length 88 [2022-01-18 08:52:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:08,886 INFO L225 Difference]: With dead ends: 211328 [2022-01-18 08:52:08,887 INFO L226 Difference]: Without dead ends: 210712 [2022-01-18 08:52:08,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 175 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=4391, Unknown=29, NotChecked=710, Total=5700 [2022-01-18 08:52:08,887 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 1949 mSDsluCounter, 7233 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 7334 SdHoareTripleChecker+Invalid, 4565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2848 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:08,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1949 Valid, 7334 Invalid, 4565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1675 Invalid, 0 Unknown, 2848 Unchecked, 0.6s Time] [2022-01-18 08:52:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210712 states. [2022-01-18 08:52:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210712 to 101068. [2022-01-18 08:52:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101068 states, 101065 states have (on average 2.984910701033988) internal successors, (301670), 101067 states have internal predecessors, (301670), 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-01-18 08:52:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101068 states to 101068 states and 301670 transitions. [2022-01-18 08:52:12,317 INFO L78 Accepts]: Start accepts. Automaton has 101068 states and 301670 transitions. Word has length 88 [2022-01-18 08:52:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:12,318 INFO L470 AbstractCegarLoop]: Abstraction has 101068 states and 301670 transitions. [2022-01-18 08:52:12,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.0) internal successors, (174), 29 states have internal predecessors, (174), 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-01-18 08:52:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101068 states and 301670 transitions. [2022-01-18 08:52:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-18 08:52:12,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:12,394 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:12,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-18 08:52:12,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:12,608 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1988769197, now seen corresponding path program 3 times [2022-01-18 08:52:12,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:12,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696094101] [2022-01-18 08:52:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:12,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:52:12,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696094101] [2022-01-18 08:52:12,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696094101] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992123534] [2022-01-18 08:52:12,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:52:12,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:12,810 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-01-18 08:52:12,811 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-01-18 08:52:12,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 08:52:12,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:52:12,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-18 08:52:12,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:12,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:12,971 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:52:12,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 08:52:13,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-18 08:52:13,113 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:13,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:13,126 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 15 treesize of output 17 [2022-01-18 08:52:13,141 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 16 treesize of output 8 [2022-01-18 08:52:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 08:52:13,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:52:13,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_847) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:52:13,168 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (forall ((v_ArrVal_847 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_847) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-18 08:52:13,171 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 32 treesize of output 24 [2022-01-18 08:52:13,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:52:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-01-18 08:52:13,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992123534] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:52:13,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:52:13,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 22 [2022-01-18 08:52:13,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873006837] [2022-01-18 08:52:13,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:52:13,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-18 08:52:13,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:13,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-18 08:52:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=320, Unknown=2, NotChecked=74, Total=462 [2022-01-18 08:52:13,304 INFO L87 Difference]: Start difference. First operand 101068 states and 301670 transitions. Second operand has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 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-01-18 08:52:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:15,610 INFO L93 Difference]: Finished difference Result 133794 states and 395057 transitions. [2022-01-18 08:52:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-18 08:52:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 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) Word has length 88 [2022-01-18 08:52:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:15,901 INFO L225 Difference]: With dead ends: 133794 [2022-01-18 08:52:15,901 INFO L226 Difference]: Without dead ends: 129601 [2022-01-18 08:52:15,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=4219, Unknown=2, NotChecked=282, Total=5402 [2022-01-18 08:52:15,902 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 1493 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1931 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:15,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 4256 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1838 Invalid, 0 Unknown, 1931 Unchecked, 1.1s Time] [2022-01-18 08:52:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129601 states. [2022-01-18 08:52:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129601 to 76504. [2022-01-18 08:52:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76504 states, 76501 states have (on average 2.9585364897190884) internal successors, (226331), 76503 states have internal predecessors, (226331), 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-01-18 08:52:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76504 states to 76504 states and 226331 transitions. [2022-01-18 08:52:18,214 INFO L78 Accepts]: Start accepts. Automaton has 76504 states and 226331 transitions. Word has length 88 [2022-01-18 08:52:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:18,214 INFO L470 AbstractCegarLoop]: Abstraction has 76504 states and 226331 transitions. [2022-01-18 08:52:18,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 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-01-18 08:52:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 76504 states and 226331 transitions. [2022-01-18 08:52:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:52:18,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:18,292 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:18,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-18 08:52:18,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:18,509 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1222382111, now seen corresponding path program 1 times [2022-01-18 08:52:18,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:18,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667351312] [2022-01-18 08:52:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:18,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:18,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667351312] [2022-01-18 08:52:18,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667351312] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066523658] [2022-01-18 08:52:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:18,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:18,670 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:52:18,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-18 08:52:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:18,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 08:52:18,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:18,822 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 6 treesize of output 5 [2022-01-18 08:52:18,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:18,910 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-01-18 08:52:19,023 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:19,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:19,052 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 14 treesize of output 16 [2022-01-18 08:52:19,066 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 15 treesize of output 7 [2022-01-18 08:52:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:19,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:52:19,128 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_915 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_915) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_914 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_914) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:19,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:52:20,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:20,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:52:20,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:52:20,498 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:20,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-01-18 08:52:20,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:52:20,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2022-01-18 08:52:20,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 14 [2022-01-18 08:52:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 7 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:20,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066523658] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:52:20,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:52:20,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-01-18 08:52:20,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626951221] [2022-01-18 08:52:20,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:52:20,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:52:20,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:52:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=513, Unknown=3, NotChecked=46, Total=650 [2022-01-18 08:52:20,673 INFO L87 Difference]: Start difference. First operand 76504 states and 226331 transitions. Second operand has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 26 states have internal predecessors, (220), 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-01-18 08:52:22,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= c_~top~0 0)) (or (forall ((v_ArrVal_915 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_915) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_914 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_914) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:23,754 INFO L93 Difference]: Finished difference Result 230965 states and 677496 transitions. [2022-01-18 08:52:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-18 08:52:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 26 states have internal predecessors, (220), 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) Word has length 97 [2022-01-18 08:52:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:24,354 INFO L225 Difference]: With dead ends: 230965 [2022-01-18 08:52:24,355 INFO L226 Difference]: Without dead ends: 229593 [2022-01-18 08:52:24,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=828, Invalid=6988, Unknown=24, NotChecked=350, Total=8190 [2022-01-18 08:52:24,357 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 1779 mSDsluCounter, 8980 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 8951 SdHoareTripleChecker+Invalid, 5610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3612 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:24,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1779 Valid, 8951 Invalid, 5610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1937 Invalid, 0 Unknown, 3612 Unchecked, 0.6s Time] [2022-01-18 08:52:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229593 states. [2022-01-18 08:52:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229593 to 126461. [2022-01-18 08:52:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126461 states, 126458 states have (on average 2.9576460168593526) internal successors, (374018), 126460 states have internal predecessors, (374018), 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-01-18 08:52:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126461 states to 126461 states and 374018 transitions. [2022-01-18 08:52:28,341 INFO L78 Accepts]: Start accepts. Automaton has 126461 states and 374018 transitions. Word has length 97 [2022-01-18 08:52:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:28,342 INFO L470 AbstractCegarLoop]: Abstraction has 126461 states and 374018 transitions. [2022-01-18 08:52:28,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 26 states have internal predecessors, (220), 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-01-18 08:52:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 126461 states and 374018 transitions. [2022-01-18 08:52:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:52:28,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:28,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:28,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-18 08:52:28,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-18 08:52:28,677 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 369454879, now seen corresponding path program 2 times [2022-01-18 08:52:28,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:28,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234101188] [2022-01-18 08:52:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:28,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:28,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234101188] [2022-01-18 08:52:28,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234101188] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614349158] [2022-01-18 08:52:28,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:52:28,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:28,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:28,852 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:52:28,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-18 08:52:28,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:52:28,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:52:28,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-18 08:52:28,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:29,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:29,060 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:29,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:29,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 50 [2022-01-18 08:52:29,117 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 7 treesize of output 5 [2022-01-18 08:52:29,126 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 15 treesize of output 11 [2022-01-18 08:52:29,148 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 16 treesize of output 8 [2022-01-18 08:52:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 08:52:29,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:52:29,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614349158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:52:29,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:52:29,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 17 [2022-01-18 08:52:29,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157256169] [2022-01-18 08:52:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:52:29,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 08:52:29,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 08:52:29,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-01-18 08:52:29,161 INFO L87 Difference]: Start difference. First operand 126461 states and 374018 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:52:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:31,131 INFO L93 Difference]: Finished difference Result 218107 states and 640587 transitions. [2022-01-18 08:52:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 08:52:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:52:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:31,889 INFO L225 Difference]: With dead ends: 218107 [2022-01-18 08:52:31,889 INFO L226 Difference]: Without dead ends: 217183 [2022-01-18 08:52:31,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-01-18 08:52:31,890 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 704 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:31,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 2234 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 08:52:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217183 states. [2022-01-18 08:52:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217183 to 130755. [2022-01-18 08:52:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130755 states, 130752 states have (on average 2.959381118453255) internal successors, (386945), 130754 states have internal predecessors, (386945), 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-01-18 08:52:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130755 states to 130755 states and 386945 transitions. [2022-01-18 08:52:36,190 INFO L78 Accepts]: Start accepts. Automaton has 130755 states and 386945 transitions. Word has length 97 [2022-01-18 08:52:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:36,190 INFO L470 AbstractCegarLoop]: Abstraction has 130755 states and 386945 transitions. [2022-01-18 08:52:36,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:52:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 130755 states and 386945 transitions. [2022-01-18 08:52:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:52:36,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:36,334 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:36,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-18 08:52:36,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:36,551 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash 464800323, now seen corresponding path program 3 times [2022-01-18 08:52:36,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263698855] [2022-01-18 08:52:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:36,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:36,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263698855] [2022-01-18 08:52:36,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263698855] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951151171] [2022-01-18 08:52:36,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:52:36,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:36,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:52:36,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-18 08:52:36,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 08:52:36,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:52:36,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 08:52:36,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:36,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:36,893 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-01-18 08:52:36,896 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-01-18 08:52:36,926 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:36,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:36,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 60 [2022-01-18 08:52:37,003 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 7 treesize of output 5 [2022-01-18 08:52:37,030 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 15 treesize of output 11 [2022-01-18 08:52:37,093 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 16 treesize of output 8 [2022-01-18 08:52:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 08:52:37,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:52:37,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951151171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:52:37,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:52:37,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2022-01-18 08:52:37,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097251788] [2022-01-18 08:52:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:52:37,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 08:52:37,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 08:52:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-01-18 08:52:37,106 INFO L87 Difference]: Start difference. First operand 130755 states and 386945 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:52:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:39,676 INFO L93 Difference]: Finished difference Result 277478 states and 813225 transitions. [2022-01-18 08:52:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 08:52:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:52:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:41,178 INFO L225 Difference]: With dead ends: 277478 [2022-01-18 08:52:41,178 INFO L226 Difference]: Without dead ends: 276806 [2022-01-18 08:52:41,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=574, Invalid=3458, Unknown=0, NotChecked=0, Total=4032 [2022-01-18 08:52:41,180 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 1226 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:41,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 2624 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 08:52:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276806 states. [2022-01-18 08:52:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276806 to 104928. [2022-01-18 08:52:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104928 states, 104925 states have (on average 2.9668239218489396) internal successors, (311294), 104927 states have internal predecessors, (311294), 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-01-18 08:52:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104928 states to 104928 states and 311294 transitions. [2022-01-18 08:52:45,393 INFO L78 Accepts]: Start accepts. Automaton has 104928 states and 311294 transitions. Word has length 97 [2022-01-18 08:52:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:52:45,393 INFO L470 AbstractCegarLoop]: Abstraction has 104928 states and 311294 transitions. [2022-01-18 08:52:45,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:52:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 104928 states and 311294 transitions. [2022-01-18 08:52:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:52:45,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:52:45,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:52:45,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-18 08:52:46,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:46,196 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:52:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:52:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2042963041, now seen corresponding path program 4 times [2022-01-18 08:52:46,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:52:46,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841871951] [2022-01-18 08:52:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:52:46,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:52:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:52:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:46,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:52:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841871951] [2022-01-18 08:52:46,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841871951] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:52:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044543264] [2022-01-18 08:52:46,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 08:52:46,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:52:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:52:46,340 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:52:46,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-18 08:52:46,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 08:52:46,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:52:46,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 08:52:46,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:52:46,535 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 6 treesize of output 5 [2022-01-18 08:52:46,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:52:46,627 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:52:46,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:52:46,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:52:46,691 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 14 treesize of output 16 [2022-01-18 08:52:46,748 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 15 treesize of output 7 [2022-01-18 08:52:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:52:46,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:52:46,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-18 08:52:46,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)))) .cse0))) is different from false [2022-01-18 08:52:47,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:52:47,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:47,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:52:47,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:52:47,637 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:52:47,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-01-18 08:52:47,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:52:47,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2022-01-18 08:52:47,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 14 [2022-01-18 08:52:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 7 times theorem prover too weak. 5 trivial. 2 not checked. [2022-01-18 08:52:47,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044543264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:52:47,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:52:47,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-01-18 08:52:47,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126779918] [2022-01-18 08:52:47,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:52:47,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:52:47,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:52:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:52:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=473, Unknown=4, NotChecked=90, Total=650 [2022-01-18 08:52:47,804 INFO L87 Difference]: Start difference. First operand 104928 states and 311294 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:52:51,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (not .cse1))) (and (not (= c_~top~0 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse2)) .cse0) .cse2 (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0)))))))))) is different from false [2022-01-18 08:52:51,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (not .cse1))) (and (not (= c_~top~0 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse2)) .cse0) .cse2))) is different from false [2022-01-18 08:52:51,747 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (not (= c_~top~0 0)) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))))))))) is different from false [2022-01-18 08:52:51,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))))))))) is different from false [2022-01-18 08:52:51,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|)) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))))))))) is different from false [2022-01-18 08:52:51,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2022-01-18 08:52:53,232 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= c_~top~0 0)) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)))) .cse0) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))))))))) is different from false [2022-01-18 08:52:53,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0)) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)))) .cse0) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (= |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) (and (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| v_ArrVal_1110) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1113) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_58| v_ArrVal_1112) |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_78|) 0) 0))))))))) is different from false [2022-01-18 08:52:53,255 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (not (= c_~top~0 0)) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1110) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse1 (forall ((v_ArrVal_1112 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1112) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1113 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1113) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)))) .cse0))) is different from false [2022-01-18 08:52:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:52:53,658 INFO L93 Difference]: Finished difference Result 393483 states and 1154931 transitions. [2022-01-18 08:52:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-01-18 08:52:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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) Word has length 97 [2022-01-18 08:52:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:52:54,856 INFO L225 Difference]: With dead ends: 393483 [2022-01-18 08:52:54,856 INFO L226 Difference]: Without dead ends: 391271 [2022-01-18 08:52:54,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 188 SyntacticMatches, 6 SemanticMatches, 174 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 11152 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2518, Invalid=24494, Unknown=92, NotChecked=3696, Total=30800 [2022-01-18 08:52:54,858 INFO L933 BasicCegarLoop]: 874 mSDtfsCounter, 2596 mSDsluCounter, 14184 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 13618 SdHoareTripleChecker+Invalid, 11017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6930 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 08:52:54,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2596 Valid, 13618 Invalid, 11017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3985 Invalid, 0 Unknown, 6930 Unchecked, 1.3s Time] [2022-01-18 08:52:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391271 states. [2022-01-18 08:53:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391271 to 178919. [2022-01-18 08:53:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178919 states, 178916 states have (on average 2.961803304343938) internal successors, (529914), 178918 states have internal predecessors, (529914), 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-01-18 08:53:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178919 states to 178919 states and 529914 transitions. [2022-01-18 08:53:02,156 INFO L78 Accepts]: Start accepts. Automaton has 178919 states and 529914 transitions. Word has length 97 [2022-01-18 08:53:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:53:02,156 INFO L470 AbstractCegarLoop]: Abstraction has 178919 states and 529914 transitions. [2022-01-18 08:53:02,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:53:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 178919 states and 529914 transitions. [2022-01-18 08:53:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:53:02,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:53:02,295 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:53:02,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-01-18 08:53:02,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:53:02,504 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:53:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:53:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1922685885, now seen corresponding path program 1 times [2022-01-18 08:53:02,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:53:02,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582753269] [2022-01-18 08:53:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:53:02,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:53:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:53:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:53:03,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:53:03,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582753269] [2022-01-18 08:53:03,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582753269] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:53:03,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353288611] [2022-01-18 08:53:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:53:03,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:53:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:53:03,300 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:53:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-18 08:53:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:53:03,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-18 08:53:03,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:53:03,522 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 6 treesize of output 5 [2022-01-18 08:53:03,594 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-01-18 08:53:03,626 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:53:03,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-18 08:53:03,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:53:03,766 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 26 treesize of output 22 [2022-01-18 08:53:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:53:03,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:53:03,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1180)))) is different from false [2022-01-18 08:53:04,039 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))) (< 64 c_~next_alloc_idx~0)) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= 0 (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2022-01-18 08:53:04,094 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))))) is different from false [2022-01-18 08:53:04,205 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))))) is different from false [2022-01-18 08:53:04,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:53:04,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:53:04,880 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:53:04,880 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2022-01-18 08:53:04,882 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 61 treesize of output 53 [2022-01-18 08:53:04,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 46 [2022-01-18 08:53:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-01-18 08:53:05,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353288611] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:53:05,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:53:05,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-01-18 08:53:05,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287807337] [2022-01-18 08:53:05,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:53:05,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:53:05,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:53:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:53:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=402, Unknown=4, NotChecked=172, Total=650 [2022-01-18 08:53:05,110 INFO L87 Difference]: Start difference. First operand 178919 states and 529914 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:53:06,115 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:53:10,540 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1180)))) (not (= c_~top~0 0)) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:53:11,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1180)))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 .cse0))) is different from false [2022-01-18 08:53:11,957 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| Int)) (and (<= 5 (select (select |c_#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) 0)) (or (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2022-01-18 08:53:11,967 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (not (= c_~top~0 0))) is different from false [2022-01-18 08:53:13,196 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))))) is different from false [2022-01-18 08:53:13,201 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (not (= c_~top~0 0))) is different from false [2022-01-18 08:53:13,626 WARN L838 $PredicateComparison]: unable to prove that (and (or (= 3 c_~top~0) (<= 5 c_~top~0)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))))) is different from false [2022-01-18 08:53:13,817 WARN L838 $PredicateComparison]: unable to prove that (and (or (= 3 c_~top~0) (<= 5 c_~top~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))))) is different from false [2022-01-18 08:53:14,562 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= 5 |c_thr1Thread2of2ForFork0_push_#t~mem6#1|) (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180))))) (not (= c_~top~0 0))) is different from false [2022-01-18 08:53:14,759 WARN L838 $PredicateComparison]: unable to prove that (and (or (= 3 c_~top~0) (<= 5 c_~top~0)) (or (<= 5 |c_thr1Thread2of2ForFork0_push_#t~mem6#1|) (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))))) is different from false [2022-01-18 08:53:16,590 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1180)))) (not (= c_~top~0 0))) is different from false [2022-01-18 08:53:19,229 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1180 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1180))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1180)))) (< 64 c_~next_alloc_idx~0)) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= 0 (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1178) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1179) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:53:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:53:19,557 INFO L93 Difference]: Finished difference Result 550985 states and 1608451 transitions. [2022-01-18 08:53:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2022-01-18 08:53:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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) Word has length 97 [2022-01-18 08:53:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:53:22,031 INFO L225 Difference]: With dead ends: 550985 [2022-01-18 08:53:22,031 INFO L226 Difference]: Without dead ends: 548206 [2022-01-18 08:53:22,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 183 SyntacticMatches, 19 SemanticMatches, 228 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 20197 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3606, Invalid=41601, Unknown=17, NotChecked=7446, Total=52670 [2022-01-18 08:53:22,034 INFO L933 BasicCegarLoop]: 1072 mSDtfsCounter, 2590 mSDsluCounter, 15830 mSDsCounter, 0 mSdLazyCounter, 5178 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 15512 SdHoareTripleChecker+Invalid, 14490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 5178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9121 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 08:53:22,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2590 Valid, 15512 Invalid, 14490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 5178 Invalid, 0 Unknown, 9121 Unchecked, 1.8s Time] [2022-01-18 08:53:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548206 states. [2022-01-18 08:53:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548206 to 265365. [2022-01-18 08:53:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265365 states, 265362 states have (on average 2.954548880397344) internal successors, (784025), 265364 states have internal predecessors, (784025), 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-01-18 08:53:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265365 states to 265365 states and 784025 transitions. [2022-01-18 08:53:33,209 INFO L78 Accepts]: Start accepts. Automaton has 265365 states and 784025 transitions. Word has length 97 [2022-01-18 08:53:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:53:33,209 INFO L470 AbstractCegarLoop]: Abstraction has 265365 states and 784025 transitions. [2022-01-18 08:53:33,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:53:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 265365 states and 784025 transitions. [2022-01-18 08:53:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:53:33,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:53:33,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:53:34,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-18 08:53:34,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 08:53:34,480 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:53:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:53:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash 383654171, now seen corresponding path program 2 times [2022-01-18 08:53:34,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:53:34,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828543909] [2022-01-18 08:53:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:53:34,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:53:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:53:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:53:34,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:53:34,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828543909] [2022-01-18 08:53:34,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828543909] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:53:34,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590594198] [2022-01-18 08:53:34,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:53:34,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:53:34,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:53:34,614 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:53:34,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-18 08:53:34,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:53:34,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:53:34,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 08:53:34,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:53:34,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:53:34,806 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:53:34,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:53:34,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:53:34,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-01-18 08:53:34,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2022-01-18 08:53:34,924 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 7 treesize of output 5 [2022-01-18 08:53:34,936 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 16 treesize of output 12 [2022-01-18 08:53:34,979 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 16 treesize of output 8 [2022-01-18 08:53:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 08:53:34,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:53:34,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590594198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:53:34,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:53:34,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2022-01-18 08:53:34,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482659744] [2022-01-18 08:53:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:53:34,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 08:53:34,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:53:34,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 08:53:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-01-18 08:53:34,991 INFO L87 Difference]: Start difference. First operand 265365 states and 784025 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:53:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:53:38,338 INFO L93 Difference]: Finished difference Result 481191 states and 1411699 transitions. [2022-01-18 08:53:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 08:53:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:53:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:53:40,614 INFO L225 Difference]: With dead ends: 481191 [2022-01-18 08:53:40,614 INFO L226 Difference]: Without dead ends: 479833 [2022-01-18 08:53:40,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=485, Invalid=2707, Unknown=0, NotChecked=0, Total=3192 [2022-01-18 08:53:40,615 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 793 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 08:53:40,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [793 Valid, 2395 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 08:53:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479833 states. [2022-01-18 08:53:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479833 to 275749. [2022-01-18 08:53:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275749 states, 275746 states have (on average 2.957703828886004) internal successors, (815575), 275748 states have internal predecessors, (815575), 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-01-18 08:53:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275749 states to 275749 states and 815575 transitions. [2022-01-18 08:53:50,437 INFO L78 Accepts]: Start accepts. Automaton has 275749 states and 815575 transitions. Word has length 97 [2022-01-18 08:53:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:53:50,438 INFO L470 AbstractCegarLoop]: Abstraction has 275749 states and 815575 transitions. [2022-01-18 08:53:50,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:53:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 275749 states and 815575 transitions. [2022-01-18 08:53:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:53:50,656 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:53:50,662 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:53:50,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-18 08:53:50,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-18 08:53:50,879 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:53:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:53:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1115056467, now seen corresponding path program 3 times [2022-01-18 08:53:50,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:53:50,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985195314] [2022-01-18 08:53:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:53:50,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:53:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:53:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:53:51,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:53:51,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985195314] [2022-01-18 08:53:51,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985195314] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:53:51,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233415147] [2022-01-18 08:53:51,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:53:51,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:53:51,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:53:51,036 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:53:51,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-18 08:53:51,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-18 08:53:51,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:53:51,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 08:53:51,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:53:51,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:53:51,249 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-01-18 08:53:51,254 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-01-18 08:53:51,360 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:53:51,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:53:51,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2022-01-18 08:53:51,408 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 7 treesize of output 5 [2022-01-18 08:53:51,426 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 16 treesize of output 12 [2022-01-18 08:53:51,459 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 16 treesize of output 8 [2022-01-18 08:53:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 08:53:51,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:53:51,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233415147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:53:51,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:53:51,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2022-01-18 08:53:51,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439800967] [2022-01-18 08:53:51,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:53:51,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 08:53:51,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:53:51,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 08:53:51,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-01-18 08:53:51,471 INFO L87 Difference]: Start difference. First operand 275749 states and 815575 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:53:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:53:55,819 INFO L93 Difference]: Finished difference Result 463791 states and 1357509 transitions. [2022-01-18 08:53:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-18 08:53:55,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:53:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:53:57,236 INFO L225 Difference]: With dead ends: 463791 [2022-01-18 08:53:57,236 INFO L226 Difference]: Without dead ends: 463091 [2022-01-18 08:53:57,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=1652, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 08:53:57,237 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 863 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 08:53:57,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [863 Valid, 2574 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-18 08:53:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463091 states. [2022-01-18 08:54:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463091 to 300102. [2022-01-18 08:54:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300102 states, 300099 states have (on average 2.957843911509202) internal successors, (887646), 300101 states have internal predecessors, (887646), 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-01-18 08:54:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300102 states to 300102 states and 887646 transitions. [2022-01-18 08:54:08,621 INFO L78 Accepts]: Start accepts. Automaton has 300102 states and 887646 transitions. Word has length 97 [2022-01-18 08:54:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:54:08,621 INFO L470 AbstractCegarLoop]: Abstraction has 300102 states and 887646 transitions. [2022-01-18 08:54:08,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:54:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 300102 states and 887646 transitions. [2022-01-18 08:54:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:54:08,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:54:08,943 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:54:08,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-18 08:54:09,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-18 08:54:09,146 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:54:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:54:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash -425768411, now seen corresponding path program 4 times [2022-01-18 08:54:09,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:54:09,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341607109] [2022-01-18 08:54:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:54:09,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:54:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:54:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:54:09,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:54:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341607109] [2022-01-18 08:54:09,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341607109] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:54:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916227628] [2022-01-18 08:54:09,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 08:54:09,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:54:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:54:09,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:54:09,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-18 08:54:09,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 08:54:09,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:54:09,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 08:54:09,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:54:09,464 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 6 treesize of output 5 [2022-01-18 08:54:09,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:54:09,540 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-01-18 08:54:09,570 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:54:09,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:54:09,600 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 14 treesize of output 16 [2022-01-18 08:54:09,647 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 15 treesize of output 7 [2022-01-18 08:54:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:54:09,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:54:09,726 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1382 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1382) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_1383 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1383) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:54:09,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-18 08:54:10,559 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:10,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:54:10,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:54:10,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:10,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-01-18 08:54:10,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 08:54:10,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2022-01-18 08:54:10,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 14 [2022-01-18 08:54:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 6 times theorem prover too weak. 5 trivial. 2 not checked. [2022-01-18 08:54:10,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916227628] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:54:10,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:54:10,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-01-18 08:54:10,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647679440] [2022-01-18 08:54:10,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:54:10,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:54:10,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:54:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:54:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=516, Unknown=5, NotChecked=46, Total=650 [2022-01-18 08:54:10,725 INFO L87 Difference]: Start difference. First operand 300102 states and 887646 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:54:13,020 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (= c_~next_alloc_idx~0 3) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 1) (or (forall ((v_ArrVal_1382 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1382) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (forall ((v_ArrVal_1383 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1383) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:54:13,597 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1382 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1382) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or .cse0 (forall ((v_ArrVal_1383 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1383) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (< 62 c_~next_alloc_idx~0)))) is different from false [2022-01-18 08:54:16,306 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1382 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1382) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (not (= c_~top~0 0)) (or .cse0 (forall ((v_ArrVal_1383 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1383) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-18 08:54:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:54:17,607 INFO L93 Difference]: Finished difference Result 412188 states and 1209667 transitions. [2022-01-18 08:54:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-01-18 08:54:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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) Word has length 97 [2022-01-18 08:54:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:54:18,950 INFO L225 Difference]: With dead ends: 412188 [2022-01-18 08:54:18,951 INFO L226 Difference]: Without dead ends: 410928 [2022-01-18 08:54:18,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 114 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 5256 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1518, Invalid=10898, Unknown=32, NotChecked=892, Total=13340 [2022-01-18 08:54:18,952 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 1864 mSDsluCounter, 6406 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 6574 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2747 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 08:54:18,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1864 Valid, 6574 Invalid, 4090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1288 Invalid, 0 Unknown, 2747 Unchecked, 0.5s Time] [2022-01-18 08:54:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410928 states. [2022-01-18 08:54:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410928 to 308810. [2022-01-18 08:54:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308810 states, 308807 states have (on average 2.9543792724905846) internal successors, (912333), 308809 states have internal predecessors, (912333), 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-01-18 08:54:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308810 states to 308810 states and 912333 transitions. [2022-01-18 08:54:29,155 INFO L78 Accepts]: Start accepts. Automaton has 308810 states and 912333 transitions. Word has length 97 [2022-01-18 08:54:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:54:29,157 INFO L470 AbstractCegarLoop]: Abstraction has 308810 states and 912333 transitions. [2022-01-18 08:54:29,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:54:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 308810 states and 912333 transitions. [2022-01-18 08:54:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:54:29,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:54:29,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:54:29,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-01-18 08:54:29,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:54:29,672 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:54:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:54:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1880571645, now seen corresponding path program 5 times [2022-01-18 08:54:29,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:54:29,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885383707] [2022-01-18 08:54:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:54:29,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:54:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:54:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:54:29,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:54:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885383707] [2022-01-18 08:54:29,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885383707] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:54:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618542211] [2022-01-18 08:54:29,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 08:54:29,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:54:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:54:29,791 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:54:29,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-18 08:54:29,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 08:54:29,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:54:29,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-18 08:54:29,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:54:29,992 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 6 treesize of output 5 [2022-01-18 08:54:30,168 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:54:30,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-01-18 08:54:30,241 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:54:30,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-18 08:54:30,374 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:30,375 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 26 treesize of output 22 [2022-01-18 08:54:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:54:30,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:54:30,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) is different from false [2022-01-18 08:54:30,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse0)))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) is different from false [2022-01-18 08:54:30,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse2 (not .cse0)) (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse2)))) is different from false [2022-01-18 08:54:30,733 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) is different from false [2022-01-18 08:54:30,886 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1))))) is different from false [2022-01-18 08:54:31,024 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_#t~mem6#1| 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1))))) is different from false [2022-01-18 08:54:31,049 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:54:31,301 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:31,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:54:31,306 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:31,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:54:31,316 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 8 treesize of output 4 [2022-01-18 08:54:31,332 INFO L353 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-01-18 08:54:31,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 105 [2022-01-18 08:54:31,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 75 treesize of output 73 [2022-01-18 08:54:31,342 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:54:31,343 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 113 treesize of output 112 [2022-01-18 08:54:31,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 82 treesize of output 80 [2022-01-18 08:54:31,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 80 treesize of output 78 [2022-01-18 08:54:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-01-18 08:54:31,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618542211] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:54:31,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:54:31,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 33 [2022-01-18 08:54:31,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474750674] [2022-01-18 08:54:31,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:54:31,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 08:54:31,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:54:31,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 08:54:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=578, Unknown=7, NotChecked=378, Total=1056 [2022-01-18 08:54:31,734 INFO L87 Difference]: Start difference. First operand 308810 states and 912333 transitions. Second operand has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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-01-18 08:54:45,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:54:45,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:54:50,977 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0)) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1452 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse0)))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:54:53,206 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (not (= (select |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0)) (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1452 Int)) (or (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse1) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse1)))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) (= 3 .cse0))) is different from false [2022-01-18 08:54:53,348 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:54:55,180 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1452 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:54:57,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1452 Int)) (or (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) (= 3 .cse0))) is different from false [2022-01-18 08:54:59,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (not (= .cse0 0)) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1452 Int)) (or (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1452)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1452)))) (= 3 .cse0))) is different from false [2022-01-18 08:54:59,644 WARN L838 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| Int)) (and (<= 5 (select (select |c_#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) 0)) (or (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2022-01-18 08:55:00,587 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:55:00,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:55:00,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (not (= c_~top~0 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:55:00,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:55:01,144 WARN L838 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0))) is different from false [2022-01-18 08:55:01,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (<= (+ c_~next_alloc_idx~0 4) 0))) .cse0))) is different from false [2022-01-18 08:55:01,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1452 Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int)) (or (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41|) 0 v_ArrVal_1452))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1452))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse2 (not .cse0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_1448 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| Int) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1448) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_41| v_ArrVal_1451) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse2)))) is different from false [2022-01-18 08:55:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:55:03,926 INFO L93 Difference]: Finished difference Result 589459 states and 1727529 transitions. [2022-01-18 08:55:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-01-18 08:55:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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) Word has length 97 [2022-01-18 08:55:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:55:05,822 INFO L225 Difference]: With dead ends: 589459 [2022-01-18 08:55:05,822 INFO L226 Difference]: Without dead ends: 588045 [2022-01-18 08:55:05,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 179 SyntacticMatches, 20 SemanticMatches, 225 ConstructedPredicates, 23 IntricatePredicates, 1 DeprecatedPredicates, 18793 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=3970, Invalid=37499, Unknown=35, NotChecked=9798, Total=51302 [2022-01-18 08:55:05,833 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 2712 mSDsluCounter, 12305 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2712 SdHoareTripleChecker+Valid, 12319 SdHoareTripleChecker+Invalid, 21078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17316 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 08:55:05,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2712 Valid, 12319 Invalid, 21078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3561 Invalid, 0 Unknown, 17316 Unchecked, 1.4s Time] [2022-01-18 08:55:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588045 states. [2022-01-18 08:55:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588045 to 328698. [2022-01-18 08:55:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328698 states, 328695 states have (on average 2.952150169610125) internal successors, (970357), 328697 states have internal predecessors, (970357), 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-01-18 08:55:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328698 states to 328698 states and 970357 transitions. [2022-01-18 08:55:19,555 INFO L78 Accepts]: Start accepts. Automaton has 328698 states and 970357 transitions. Word has length 97 [2022-01-18 08:55:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:55:19,555 INFO L470 AbstractCegarLoop]: Abstraction has 328698 states and 970357 transitions. [2022-01-18 08:55:19,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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-01-18 08:55:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 328698 states and 970357 transitions. [2022-01-18 08:55:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:55:19,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:55:19,843 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:55:19,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-18 08:55:20,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:55:20,061 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:55:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:55:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash -233681303, now seen corresponding path program 6 times [2022-01-18 08:55:20,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:55:20,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497131777] [2022-01-18 08:55:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:55:20,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:55:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:55:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:55:20,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:55:20,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497131777] [2022-01-18 08:55:20,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497131777] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:55:20,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708593312] [2022-01-18 08:55:20,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 08:55:20,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:55:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:55:20,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:55:20,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-18 08:55:20,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-18 08:55:20,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:55:20,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-18 08:55:20,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:55:20,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:55:20,473 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:55:20,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:55:20,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2022-01-18 08:55:20,527 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-18 08:55:20,551 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 16 treesize of output 12 [2022-01-18 08:55:20,568 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 16 treesize of output 8 [2022-01-18 08:55:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 08:55:20,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:55:20,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708593312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:55:20,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:55:20,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 18 [2022-01-18 08:55:20,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294540507] [2022-01-18 08:55:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:55:20,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 08:55:20,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:55:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 08:55:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-01-18 08:55:20,582 INFO L87 Difference]: Start difference. First operand 328698 states and 970357 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:55:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:55:25,159 INFO L93 Difference]: Finished difference Result 512181 states and 1503533 transitions. [2022-01-18 08:55:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-18 08:55:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:55:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:55:27,377 INFO L225 Difference]: With dead ends: 512181 [2022-01-18 08:55:27,378 INFO L226 Difference]: Without dead ends: 511467 [2022-01-18 08:55:27,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 08:55:27,378 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 663 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 08:55:27,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 2363 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 08:55:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511467 states. [2022-01-18 08:55:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511467 to 301465. [2022-01-18 08:55:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301465 states, 301462 states have (on average 2.9604195553668458) internal successors, (892454), 301464 states have internal predecessors, (892454), 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-01-18 08:55:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301465 states to 301465 states and 892454 transitions. [2022-01-18 08:55:39,207 INFO L78 Accepts]: Start accepts. Automaton has 301465 states and 892454 transitions. Word has length 97 [2022-01-18 08:55:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:55:39,207 INFO L470 AbstractCegarLoop]: Abstraction has 301465 states and 892454 transitions. [2022-01-18 08:55:39,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:55:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 301465 states and 892454 transitions. [2022-01-18 08:55:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:55:39,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:55:39,490 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:55:39,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-18 08:55:39,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-18 08:55:39,698 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:55:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:55:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -154651581, now seen corresponding path program 7 times [2022-01-18 08:55:39,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:55:39,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440278150] [2022-01-18 08:55:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:55:39,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:55:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:55:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:55:39,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:55:39,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440278150] [2022-01-18 08:55:39,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440278150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:55:39,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983330771] [2022-01-18 08:55:39,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 08:55:39,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:55:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:55:39,832 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:55:39,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-18 08:55:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:55:39,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-18 08:55:39,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:55:40,025 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 6 treesize of output 5 [2022-01-18 08:55:40,101 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-01-18 08:55:40,163 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:55:40,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-18 08:55:40,304 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:55:40,304 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 26 treesize of output 22 [2022-01-18 08:55:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:55:40,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:55:40,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)))) is different from false [2022-01-18 08:55:42,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))))) is different from false [2022-01-18 08:55:42,583 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582)))) (< 64 c_~next_alloc_idx~0))) is different from false [2022-01-18 08:55:42,637 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2022-01-18 08:55:43,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:55:43,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:55:44,001 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:55:44,001 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2022-01-18 08:55:44,003 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 61 treesize of output 53 [2022-01-18 08:55:44,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 46 [2022-01-18 08:55:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-01-18 08:55:44,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983330771] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:55:44,146 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:55:44,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-01-18 08:55:44,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251183177] [2022-01-18 08:55:44,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:55:44,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 08:55:44,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:55:44,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 08:55:44,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=404, Unknown=4, NotChecked=172, Total=650 [2022-01-18 08:55:44,147 INFO L87 Difference]: Start difference. First operand 301465 states and 892454 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:55:47,695 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0)) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1582 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))))) (= c_~next_alloc_idx~0 5) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:55:53,193 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0)) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (forall ((v_ArrVal_1582 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))))) (not (= c_~top~0 0)) (= c_~next_alloc_idx~0 5) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:55:56,269 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:55:58,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| .cse0) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse1))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 .cse0))) is different from false [2022-01-18 08:55:58,645 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64)) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| Int)) (and (<= 5 (select (select |c_#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) 0)) (or (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base|) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2022-01-18 08:55:59,949 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1582)))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:56:00,131 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0))) is different from false [2022-01-18 08:56:03,280 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0))) is different from false [2022-01-18 08:56:03,643 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64)) (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (not (= c_~top~0 0))) is different from false [2022-01-18 08:56:05,187 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (= 3 c_~top~0) (<= 5 c_~top~0)) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2022-01-18 08:56:05,397 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (<= 5 |c_thr1Thread2of2ForFork0_push_#t~mem6#1|) (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3)) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0))) is different from false [2022-01-18 08:56:05,626 WARN L838 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582))))) (or (= 3 c_~top~0) (<= 5 c_~top~0)) (or (<= 5 |c_thr1Thread2of2ForFork0_push_#t~mem6#1|) (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3)) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2022-01-18 08:56:07,261 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1579) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (<= c_~next_alloc_idx~0 64)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) 0 v_ArrVal_1582))) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1582)))) (< 64 c_~next_alloc_idx~0))) is different from false [2022-01-18 08:56:07,266 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_1582 Int)) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1581 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| v_ArrVal_1581) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_44|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1582)) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))) (not (<= c_~next_alloc_idx~0 v_ArrVal_1582))))) is different from false [2022-01-18 08:56:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:56:10,057 INFO L93 Difference]: Finished difference Result 847584 states and 2479537 transitions. [2022-01-18 08:56:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2022-01-18 08:56:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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) Word has length 97 [2022-01-18 08:56:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:56:14,387 INFO L225 Difference]: With dead ends: 847584 [2022-01-18 08:56:14,387 INFO L226 Difference]: Without dead ends: 844518 [2022-01-18 08:56:14,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 189 SyntacticMatches, 23 SemanticMatches, 293 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 35078 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=6548, Invalid=69956, Unknown=20, NotChecked=10206, Total=86730 [2022-01-18 08:56:14,390 INFO L933 BasicCegarLoop]: 1022 mSDtfsCounter, 2804 mSDsluCounter, 13066 mSDsCounter, 0 mSdLazyCounter, 4780 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2804 SdHoareTripleChecker+Valid, 12908 SdHoareTripleChecker+Invalid, 19248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 4780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14235 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 08:56:14,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2804 Valid, 12908 Invalid, 19248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 4780 Invalid, 0 Unknown, 14235 Unchecked, 1.8s Time] [2022-01-18 08:56:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844518 states. [2022-01-18 08:56:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844518 to 422731. [2022-01-18 08:56:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422731 states, 422728 states have (on average 2.946849983914006) internal successors, (1245716), 422730 states have internal predecessors, (1245716), 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-01-18 08:56:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422731 states to 422731 states and 1245716 transitions. [2022-01-18 08:56:32,622 INFO L78 Accepts]: Start accepts. Automaton has 422731 states and 1245716 transitions. Word has length 97 [2022-01-18 08:56:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:56:32,623 INFO L470 AbstractCegarLoop]: Abstraction has 422731 states and 1245716 transitions. [2022-01-18 08:56:32,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 26 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-01-18 08:56:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 422731 states and 1245716 transitions. [2022-01-18 08:56:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:56:33,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:56:33,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:56:33,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-01-18 08:56:33,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-01-18 08:56:33,225 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:56:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:56:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2143278821, now seen corresponding path program 8 times [2022-01-18 08:56:33,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:56:33,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021321034] [2022-01-18 08:56:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:56:33,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:56:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:56:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:56:33,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:56:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021321034] [2022-01-18 08:56:33,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021321034] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:56:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305293680] [2022-01-18 08:56:33,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 08:56:33,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:56:33,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:56:33,356 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:56:33,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-18 08:56:33,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 08:56:33,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:56:33,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 08:56:33,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:56:33,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:56:33,571 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-01-18 08:56:33,576 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-01-18 08:56:33,609 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:56:33,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:56:33,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2022-01-18 08:56:33,702 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 7 treesize of output 5 [2022-01-18 08:56:33,714 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 16 treesize of output 12 [2022-01-18 08:56:33,758 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 16 treesize of output 8 [2022-01-18 08:56:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 08:56:33,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:56:33,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305293680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:56:33,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:56:33,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2022-01-18 08:56:33,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966798959] [2022-01-18 08:56:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:56:33,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 08:56:33,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:56:33,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 08:56:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-01-18 08:56:33,770 INFO L87 Difference]: Start difference. First operand 422731 states and 1245716 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:56:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:56:38,589 INFO L93 Difference]: Finished difference Result 700847 states and 2049034 transitions. [2022-01-18 08:56:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 08:56:38,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:56:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:56:41,755 INFO L225 Difference]: With dead ends: 700847 [2022-01-18 08:56:41,756 INFO L226 Difference]: Without dead ends: 700161 [2022-01-18 08:56:41,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=331, Invalid=1649, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 08:56:41,756 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 704 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 08:56:41,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 2226 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 08:56:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700161 states. [2022-01-18 08:56:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700161 to 434768. [2022-01-18 08:56:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434768 states, 434765 states have (on average 2.948293905903189) internal successors, (1281815), 434767 states have internal predecessors, (1281815), 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-01-18 08:56:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434768 states to 434768 states and 1281815 transitions. [2022-01-18 08:56:59,931 INFO L78 Accepts]: Start accepts. Automaton has 434768 states and 1281815 transitions. Word has length 97 [2022-01-18 08:56:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:56:59,932 INFO L470 AbstractCegarLoop]: Abstraction has 434768 states and 1281815 transitions. [2022-01-18 08:56:59,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-01-18 08:56:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 434768 states and 1281815 transitions. [2022-01-18 08:57:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:57:00,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:57:00,326 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:57:00,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-18 08:57:00,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:57:00,542 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:57:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:57:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1654807581, now seen corresponding path program 5 times [2022-01-18 08:57:00,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:57:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882542296] [2022-01-18 08:57:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:57:00,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:57:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:57:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:57:00,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:57:00,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882542296] [2022-01-18 08:57:00,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882542296] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:57:00,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308770907] [2022-01-18 08:57:00,648 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 08:57:00,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:57:00,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:57:00,649 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:57:00,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-18 08:57:00,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 08:57:00,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:57:00,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-18 08:57:00,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:57:00,851 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 6 treesize of output 5 [2022-01-18 08:57:01,039 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 08:57:01,055 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:57:01,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-01-18 08:57:01,095 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-18 08:57:01,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-18 08:57:01,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:57:01,233 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 26 treesize of output 22 [2022-01-18 08:57:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:57:01,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:57:01,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1717)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717)) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))))) is different from false [2022-01-18 08:57:01,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) is different from false [2022-01-18 08:57:01,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)))) is different from false [2022-01-18 08:57:01,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) is different from false [2022-01-18 08:57:01,855 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717)))))))) is different from false [2022-01-18 08:57:01,988 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_#t~mem6#1| 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717)))))))) is different from false [2022-01-18 08:57:02,011 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-18 08:57:02,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:57:02,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-18 08:57:02,250 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:57:02,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-18 08:57:02,260 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 8 treesize of output 4 [2022-01-18 08:57:02,291 INFO L353 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2022-01-18 08:57:02,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 109 [2022-01-18 08:57:02,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 77 treesize of output 75 [2022-01-18 08:57:02,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 75 treesize of output 73 [2022-01-18 08:57:02,303 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:57:02,303 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 115 treesize of output 114 [2022-01-18 08:57:02,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 84 treesize of output 82 [2022-01-18 08:57:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 28 not checked. [2022-01-18 08:57:02,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308770907] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:57:02,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:57:02,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 33 [2022-01-18 08:57:02,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608610452] [2022-01-18 08:57:02,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:57:02,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 08:57:02,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:57:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 08:57:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=574, Unknown=7, NotChecked=378, Total=1056 [2022-01-18 08:57:02,553 INFO L87 Difference]: Start difference. First operand 434768 states and 1281815 transitions. Second operand has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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-01-18 08:57:03,569 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) .cse3) (not .cse3) (or .cse0 (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (< 0 (+ c_~next_alloc_idx~0 4)))))) is different from false [2022-01-18 08:57:04,720 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) (and (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= .cse3 0)) (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| .cse3))) is different from false [2022-01-18 08:57:04,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~top~0 0))) (and (or .cse0 (let ((.cse1 (< 64 c_~next_alloc_idx~0)) (.cse2 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse2)) (or .cse2 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse3 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse3 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse3 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717)))))))) (not .cse0))) is different from false [2022-01-18 08:57:04,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (and (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) .cse3) (not .cse3))) is different from false [2022-01-18 08:57:05,020 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (< 0 (+ c_~next_alloc_idx~0 4)))))) is different from false [2022-01-18 08:57:05,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) .cse3) (not .cse3) (not (= c_~top~0 0)) (or .cse0 (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (< 0 (+ c_~next_alloc_idx~0 4)))))) is different from false [2022-01-18 08:57:05,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0)) (or .cse0 (and (<= c_~next_alloc_idx~0 60) (not (= (+ c_~next_alloc_idx~0 2) 0)) (< 0 (+ c_~next_alloc_idx~0 4)))))) is different from false [2022-01-18 08:57:05,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of2ForFork0_push_#t~mem6#1| 0))) (and (or .cse0 (let ((.cse1 (< 64 c_~next_alloc_idx~0)) (.cse2 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse2)) (or .cse2 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse3 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse3 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse3 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717)))))))) (not .cse0))) is different from false [2022-01-18 08:57:07,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= .cse3 0)) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1717 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1717)) (let ((.cse4 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse4)) (or .cse4 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717)) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 .cse3))) is different from false [2022-01-18 08:57:09,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| 0) (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= .cse3 0)) (<= c_~next_alloc_idx~0 5) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|)) (forall ((v_ArrVal_1717 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1717)) (let ((.cse4 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse4)) (or .cse4 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717)) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| 0) (= c_~next_alloc_idx~0 5) (= 3 .cse3) (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| .cse3))) is different from false [2022-01-18 08:57:09,830 WARN L838 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= c_~top~0 0))) is different from false [2022-01-18 08:57:11,095 WARN L838 $PredicateComparison]: unable to prove that (and (or (= 3 c_~top~0) (<= 5 c_~top~0)) (or (= c_~top~0 0) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not .cse1)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) 0 v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))))) is different from false [2022-01-18 08:57:12,923 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse1)) (not (= (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_1714 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int)) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1714) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse1 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1717 Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717))) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)) (not (<= (+ c_~next_alloc_idx~0 2) v_ArrVal_1717))))))) is different from false [2022-01-18 08:57:13,126 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1717 Int)) (or (not (<= c_~next_alloc_idx~0 v_ArrVal_1717)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int) (v_ArrVal_1719 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| v_ArrVal_1719) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_35|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1717)) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (= |c_thr1Thread1of2ForFork0_push_#t~mem3#1| (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-18 08:57:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:57:15,851 INFO L93 Difference]: Finished difference Result 847399 states and 2480119 transitions. [2022-01-18 08:57:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-01-18 08:57:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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) Word has length 97 [2022-01-18 08:57:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:57:20,219 INFO L225 Difference]: With dead ends: 847399 [2022-01-18 08:57:20,219 INFO L226 Difference]: Without dead ends: 845537 [2022-01-18 08:57:20,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 190 SyntacticMatches, 26 SemanticMatches, 190 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 12813 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2721, Invalid=26412, Unknown=21, NotChecked=7518, Total=36672 [2022-01-18 08:57:20,221 INFO L933 BasicCegarLoop]: 891 mSDtfsCounter, 2204 mSDsluCounter, 11524 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 11594 SdHoareTripleChecker+Invalid, 19206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15915 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 08:57:20,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2204 Valid, 11594 Invalid, 19206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3165 Invalid, 0 Unknown, 15915 Unchecked, 1.1s Time] [2022-01-18 08:57:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845537 states. [2022-01-18 08:57:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845537 to 479499. [2022-01-18 08:57:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479499 states, 479496 states have (on average 2.9463791147371405) internal successors, (1412777), 479498 states have internal predecessors, (1412777), 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-01-18 08:57:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479499 states to 479499 states and 1412777 transitions. [2022-01-18 08:57:40,678 INFO L78 Accepts]: Start accepts. Automaton has 479499 states and 1412777 transitions. Word has length 97 [2022-01-18 08:57:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:57:40,678 INFO L470 AbstractCegarLoop]: Abstraction has 479499 states and 1412777 transitions. [2022-01-18 08:57:40,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.454545454545454) internal successors, (213), 33 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-01-18 08:57:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 479499 states and 1412777 transitions. [2022-01-18 08:57:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:57:41,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:57:41,969 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:57:41,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-18 08:57:42,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:57:42,179 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:57:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:57:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1798022241, now seen corresponding path program 6 times [2022-01-18 08:57:42,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:57:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333016144] [2022-01-18 08:57:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:57:42,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:57:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:57:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:57:42,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:57:42,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333016144] [2022-01-18 08:57:42,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333016144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:57:42,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812015875] [2022-01-18 08:57:42,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 08:57:42,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:57:42,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:57:42,294 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:57:42,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-18 08:57:42,415 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-01-18 08:57:42,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:57:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-18 08:57:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:57:42,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-18 08:57:42,509 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 08:57:42,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-01-18 08:57:42,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 50 [2022-01-18 08:57:42,560 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 7 treesize of output 5 [2022-01-18 08:57:42,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 08:57:42,591 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 16 treesize of output 8 [2022-01-18 08:57:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-18 08:57:42,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 08:57:42,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812015875] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 08:57:42,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 08:57:42,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 17 [2022-01-18 08:57:42,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797310335] [2022-01-18 08:57:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 08:57:42,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 08:57:42,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:57:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 08:57:42,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-01-18 08:57:42,605 INFO L87 Difference]: Start difference. First operand 479499 states and 1412777 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:57:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 08:57:47,861 INFO L93 Difference]: Finished difference Result 725157 states and 2121834 transitions. [2022-01-18 08:57:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 08:57:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) Word has length 97 [2022-01-18 08:57:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 08:57:51,208 INFO L225 Difference]: With dead ends: 725157 [2022-01-18 08:57:51,208 INFO L226 Difference]: Without dead ends: 724051 [2022-01-18 08:57:51,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=2758, Unknown=0, NotChecked=0, Total=3192 [2022-01-18 08:57:51,209 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 757 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 08:57:51,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 2900 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 08:57:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724051 states. [2022-01-18 08:58:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724051 to 443349. [2022-01-18 08:58:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443349 states, 443346 states have (on average 2.9476729236307535) internal successors, (1306839), 443348 states have internal predecessors, (1306839), 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-01-18 08:58:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443349 states to 443349 states and 1306839 transitions. [2022-01-18 08:58:10,821 INFO L78 Accepts]: Start accepts. Automaton has 443349 states and 1306839 transitions. Word has length 97 [2022-01-18 08:58:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 08:58:10,831 INFO L470 AbstractCegarLoop]: Abstraction has 443349 states and 1306839 transitions. [2022-01-18 08:58:10,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-01-18 08:58:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 443349 states and 1306839 transitions. [2022-01-18 08:58:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-18 08:58:11,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 08:58:11,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 08:58:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-18 08:58:11,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:58:11,657 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 08:58:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 08:58:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1813317413, now seen corresponding path program 9 times [2022-01-18 08:58:11,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 08:58:11,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817099209] [2022-01-18 08:58:11,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 08:58:11,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 08:58:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 08:58:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:58:11,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 08:58:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817099209] [2022-01-18 08:58:11,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817099209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 08:58:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288077169] [2022-01-18 08:58:11,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 08:58:11,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 08:58:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 08:58:11,896 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 08:58:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-18 08:58:12,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 08:58:12,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 08:58:12,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-18 08:58:12,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 08:58:12,194 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 6 treesize of output 5 [2022-01-18 08:58:12,269 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 13 treesize of output 9 [2022-01-18 08:58:12,453 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 08:58:12,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-01-18 08:58:12,495 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 22 treesize of output 10 [2022-01-18 08:58:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 08:58:12,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 08:58:12,578 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1848 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((v_ArrVal_1849 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))) is different from false [2022-01-18 08:58:12,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (- 1) (select (select |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1848 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or (forall ((v_ArrVal_1849 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0))))) is different from false [2022-01-18 08:58:13,067 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1846))) (or (not (= (- 1) (select (select .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (not (= (select (select (store .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))))) (not .cse1)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (not (= (- 1) (select (select (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (let ((.cse2 (< 62 c_~next_alloc_idx~0))) (and (or .cse2 (forall ((v_ArrVal_1849 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1848 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse2))))))))) is different from false [2022-01-18 08:58:13,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1846))) (or (not (= (select (select (store .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (= (- 1) (select (select .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0)))))) (not .cse1)) (or .cse1 (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1849 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))) (not (= (- 1) (select (select (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0)))))))) is different from false [2022-01-18 08:58:13,178 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1846))) (or (not (= (select (select (store .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (= (- 1) (select (select .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0)))))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (- 1) (select (select .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (not (= (select (select (store .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0))))))) is different from false [2022-01-18 08:58:13,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:58:13,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-18 08:58:13,964 INFO L353 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-01-18 08:58:13,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2022-01-18 08:58:13,984 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 08:58:13,984 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 46 treesize of output 42 [2022-01-18 08:58:13,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-01-18 08:58:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 8 not checked. [2022-01-18 08:58:14,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288077169] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 08:58:14,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 08:58:14,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25 [2022-01-18 08:58:14,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561301941] [2022-01-18 08:58:14,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 08:58:14,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 08:58:14,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 08:58:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 08:58:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=314, Unknown=8, NotChecked=200, Total=600 [2022-01-18 08:58:14,369 INFO L87 Difference]: Start difference. First operand 443349 states and 1306839 transitions. Second operand has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 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-01-18 08:58:33,471 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1846))) (or (not (= (select (select (store .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (= (- 1) (select (select .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0)))))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (- 1) (select (select .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (not (= (select (select (store .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-18 08:58:33,830 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1846))) (or (not (= (select (select (store .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1848) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)) (not (= (- 1) (select (select .cse0 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0)))))) (not (< 64 c_~next_alloc_idx~0))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread2of2ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread1of2ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (- 1) (select (select .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) 0))) (not (= (select (select (store .cse1 |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_1849) |thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) 0) 0)))))) (not (= c_~top~0 0))) is different from false