/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 12:51:44,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 12:51:44,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 12:51:44,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 12:51:44,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 12:51:44,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 12:51:44,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 12:51:44,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 12:51:44,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 12:51:44,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 12:51:44,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 12:51:44,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 12:51:44,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 12:51:44,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 12:51:44,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 12:51:44,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 12:51:44,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 12:51:44,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 12:51:44,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 12:51:44,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 12:51:44,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 12:51:44,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 12:51:44,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 12:51:44,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 12:51:44,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 12:51:44,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 12:51:44,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 12:51:44,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 12:51:44,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 12:51:44,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 12:51:44,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 12:51:44,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 12:51:44,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 12:51:44,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 12:51:44,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 12:51:44,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 12:51:44,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 12:51:44,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 12:51:44,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 12:51:44,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 12:51:44,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 12:51:44,968 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.epf [2022-03-15 12:51:44,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 12:51:44,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 12:51:44,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 12:51:44,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 12:51:44,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 12:51:44,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 12:51:44,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 12:51:44,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 12:51:44,992 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 12:51:44,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 12:51:44,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 12:51:44,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 12:51:44,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 12:51:44,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 12:51:44,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 12:51:44,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 12:51:45,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 12:51:45,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 12:51:45,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 12:51:45,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 12:51:45,203 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 12:51:45,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-03-15 12:51:45,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e9927bb/3ec11d7c2f084e7699f92b7682410441/FLAGab06d1a39 [2022-03-15 12:51:45,730 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 12:51:45,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-03-15 12:51:45,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e9927bb/3ec11d7c2f084e7699f92b7682410441/FLAGab06d1a39 [2022-03-15 12:51:46,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e9927bb/3ec11d7c2f084e7699f92b7682410441 [2022-03-15 12:51:46,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 12:51:46,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 12:51:46,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 12:51:46,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 12:51:46,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 12:51:46,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eea2a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46, skipping insertion in model container [2022-03-15 12:51:46,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 12:51:46,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 12:51:46,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-15 12:51:46,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 12:51:46,672 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 12:51:46,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-15 12:51:46,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 12:51:46,769 INFO L208 MainTranslator]: Completed translation [2022-03-15 12:51:46,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46 WrapperNode [2022-03-15 12:51:46,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 12:51:46,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 12:51:46,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 12:51:46,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 12:51:46,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,820 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-03-15 12:51:46,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 12:51:46,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 12:51:46,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 12:51:46,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 12:51:46,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 12:51:46,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 12:51:46,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 12:51:46,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 12:51:46,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (1/1) ... [2022-03-15 12:51:46,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 12:51:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:51:46,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 12:51:46,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 12:51:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 12:51:46,918 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 12:51:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 12:51:46,918 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 12:51:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 12:51:46,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 12:51:46,920 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 12:51:47,003 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 12:51:47,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 12:51:47,186 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 12:51:47,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 12:51:47,193 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 12:51:47,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:51:47 BoogieIcfgContainer [2022-03-15 12:51:47,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 12:51:47,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 12:51:47,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 12:51:47,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 12:51:47,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:51:46" (1/3) ... [2022-03-15 12:51:47,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb90b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:51:47, skipping insertion in model container [2022-03-15 12:51:47,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:46" (2/3) ... [2022-03-15 12:51:47,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb90b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:51:47, skipping insertion in model container [2022-03-15 12:51:47,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:51:47" (3/3) ... [2022-03-15 12:51:47,215 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-03-15 12:51:47,218 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 12:51:47,218 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 12:51:47,218 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 12:51:47,218 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 12:51:47,252 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,252 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,257 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,258 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,272 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,273 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,274 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,275 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,275 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,275 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,275 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,276 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,304 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 12:51:47,312 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 12:51:47,357 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 12:51:47,362 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, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 12:51:47,362 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 12:51:47,378 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 176 transitions, 368 flow [2022-03-15 12:51:47,759 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-15 12:51:47,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:47,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 12:51:47,813 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-03-15 12:51:47,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:47,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134832654] [2022-03-15 12:51:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:48,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:48,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134832654] [2022-03-15 12:51:48,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134832654] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:48,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:48,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 12:51:48,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014191350] [2022-03-15 12:51:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:48,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 12:51:48,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 12:51:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:48,159 INFO L87 Difference]: Start difference. First operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 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 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:48,386 INFO L93 Difference]: Finished difference Result 15687 states and 43137 transitions. [2022-03-15 12:51:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 12:51:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-15 12:51:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:48,475 INFO L225 Difference]: With dead ends: 15687 [2022-03-15 12:51:48,476 INFO L226 Difference]: Without dead ends: 15411 [2022-03-15 12:51:48,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:48,479 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:48,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 12:51:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15411 states. [2022-03-15 12:51:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15411 to 14887. [2022-03-15 12:51:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14887 states, 14883 states have (on average 2.7668480817039574) internal successors, (41179), 14886 states have internal predecessors, (41179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 41179 transitions. [2022-03-15 12:51:49,070 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 41179 transitions. Word has length 65 [2022-03-15 12:51:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:49,071 INFO L470 AbstractCegarLoop]: Abstraction has 14887 states and 41179 transitions. [2022-03-15 12:51:49,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 41179 transitions. [2022-03-15 12:51:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-03-15 12:51:49,077 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:49,077 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, 1, 1, 1, 1, 1, 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-03-15 12:51:49,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 12:51:49,077 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:49,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-03-15 12:51:49,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:49,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956056019] [2022-03-15 12:51:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:49,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:49,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956056019] [2022-03-15 12:51:49,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956056019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:49,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:49,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 12:51:49,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928250045] [2022-03-15 12:51:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:49,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 12:51:49,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 12:51:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 12:51:49,195 INFO L87 Difference]: Start difference. First operand 14887 states and 41179 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:49,347 INFO L93 Difference]: Finished difference Result 22347 states and 61714 transitions. [2022-03-15 12:51:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 12:51:49,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2022-03-15 12:51:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:49,421 INFO L225 Difference]: With dead ends: 22347 [2022-03-15 12:51:49,421 INFO L226 Difference]: Without dead ends: 22347 [2022-03-15 12:51:49,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-15 12:51:49,422 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 146 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:49,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 642 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 12:51:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2022-03-15 12:51:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 16015. [2022-03-15 12:51:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16015 states, 16011 states have (on average 2.7665355068390483) internal successors, (44295), 16014 states have internal predecessors, (44295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 44295 transitions. [2022-03-15 12:51:49,948 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 44295 transitions. Word has length 81 [2022-03-15 12:51:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:49,949 INFO L470 AbstractCegarLoop]: Abstraction has 16015 states and 44295 transitions. [2022-03-15 12:51:49,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 44295 transitions. [2022-03-15 12:51:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-15 12:51:49,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:49,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:51:49,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 12:51:49,959 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 235148469, now seen corresponding path program 1 times [2022-03-15 12:51:49,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:49,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805647386] [2022-03-15 12:51:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:50,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:50,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805647386] [2022-03-15 12:51:50,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805647386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:50,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:50,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 12:51:50,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121674049] [2022-03-15 12:51:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:50,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 12:51:50,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 12:51:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:50,047 INFO L87 Difference]: Start difference. First operand 16015 states and 44295 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:50,260 INFO L93 Difference]: Finished difference Result 24457 states and 67330 transitions. [2022-03-15 12:51:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 12:51:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2022-03-15 12:51:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:50,391 INFO L225 Difference]: With dead ends: 24457 [2022-03-15 12:51:50,391 INFO L226 Difference]: Without dead ends: 24457 [2022-03-15 12:51:50,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:50,394 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 103 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:50,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 377 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 12:51:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24457 states. [2022-03-15 12:51:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24457 to 22373. [2022-03-15 12:51:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22373 states, 22369 states have (on average 2.7695471411328176) internal successors, (61952), 22372 states have internal predecessors, (61952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 61952 transitions. [2022-03-15 12:51:50,978 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 61952 transitions. Word has length 99 [2022-03-15 12:51:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:50,978 INFO L470 AbstractCegarLoop]: Abstraction has 22373 states and 61952 transitions. [2022-03-15 12:51:50,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 61952 transitions. [2022-03-15 12:51:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 12:51:50,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:50,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:51:50,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 12:51:50,992 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-03-15 12:51:50,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:50,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827860389] [2022-03-15 12:51:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:51,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:51,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827860389] [2022-03-15 12:51:51,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827860389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 12:51:51,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845749240] [2022-03-15 12:51:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:51,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:51:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:51:51,098 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-03-15 12:51:51,099 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-03-15 12:51:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:51,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 12:51:51,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 12:51:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:51,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 12:51:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:51,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845749240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 12:51:51,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 12:51:51,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 12:51:51,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722723379] [2022-03-15 12:51:51,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 12:51:51,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 12:51:51,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 12:51:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 12:51:51,666 INFO L87 Difference]: Start difference. First operand 22373 states and 61952 transitions. Second operand has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:51,974 INFO L93 Difference]: Finished difference Result 43271 states and 119230 transitions. [2022-03-15 12:51:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 12:51:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 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 110 [2022-03-15 12:51:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:52,197 INFO L225 Difference]: With dead ends: 43271 [2022-03-15 12:51:52,197 INFO L226 Difference]: Without dead ends: 43119 [2022-03-15 12:51:52,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-03-15 12:51:52,203 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 979 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:52,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 1276 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 12:51:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43119 states. [2022-03-15 12:51:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43119 to 35319. [2022-03-15 12:51:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35319 states, 35315 states have (on average 2.7909103780263345) internal successors, (98561), 35318 states have internal predecessors, (98561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 98561 transitions. [2022-03-15 12:51:53,059 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 98561 transitions. Word has length 110 [2022-03-15 12:51:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:53,060 INFO L470 AbstractCegarLoop]: Abstraction has 35319 states and 98561 transitions. [2022-03-15 12:51:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 98561 transitions. [2022-03-15 12:51:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-15 12:51:53,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:53,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:51:53,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 12:51:53,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:51:53,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash -154454040, now seen corresponding path program 1 times [2022-03-15 12:51:53,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:53,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531292285] [2022-03-15 12:51:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:53,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:53,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531292285] [2022-03-15 12:51:53,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531292285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:53,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:53,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 12:51:53,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688396535] [2022-03-15 12:51:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:53,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 12:51:53,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 12:51:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:53,375 INFO L87 Difference]: Start difference. First operand 35319 states and 98561 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:53,535 INFO L93 Difference]: Finished difference Result 11357 states and 29882 transitions. [2022-03-15 12:51:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 12:51:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-03-15 12:51:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:53,563 INFO L225 Difference]: With dead ends: 11357 [2022-03-15 12:51:53,563 INFO L226 Difference]: Without dead ends: 11319 [2022-03-15 12:51:53,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 12:51:53,564 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:53,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 238 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 12:51:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2022-03-15 12:51:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 9775. [2022-03-15 12:51:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 9771 states have (on average 2.607102650701054) internal successors, (25474), 9774 states have internal predecessors, (25474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 25474 transitions. [2022-03-15 12:51:53,706 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 25474 transitions. Word has length 113 [2022-03-15 12:51:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:53,706 INFO L470 AbstractCegarLoop]: Abstraction has 9775 states and 25474 transitions. [2022-03-15 12:51:53,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 25474 transitions. [2022-03-15 12:51:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-15 12:51:53,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:53,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:51:53,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 12:51:53,714 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1480826348, now seen corresponding path program 1 times [2022-03-15 12:51:53,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:53,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660335674] [2022-03-15 12:51:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:54,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:54,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660335674] [2022-03-15 12:51:54,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660335674] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:54,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:54,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-15 12:51:54,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906396786] [2022-03-15 12:51:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:54,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 12:51:54,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 12:51:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-03-15 12:51:54,403 INFO L87 Difference]: Start difference. First operand 9775 states and 25474 transitions. Second operand has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:56,760 INFO L93 Difference]: Finished difference Result 24261 states and 63753 transitions. [2022-03-15 12:51:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 12:51:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 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 122 [2022-03-15 12:51:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:56,800 INFO L225 Difference]: With dead ends: 24261 [2022-03-15 12:51:56,800 INFO L226 Difference]: Without dead ends: 23418 [2022-03-15 12:51:56,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=557, Invalid=2865, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 12:51:56,803 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1242 mSDsluCounter, 7540 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 7914 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:56,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1242 Valid, 7914 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 12:51:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23418 states. [2022-03-15 12:51:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23418 to 12562. [2022-03-15 12:51:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 12558 states have (on average 2.6335403726708075) internal successors, (33072), 12561 states have internal predecessors, (33072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 33072 transitions. [2022-03-15 12:51:57,105 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 33072 transitions. Word has length 122 [2022-03-15 12:51:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:51:57,106 INFO L470 AbstractCegarLoop]: Abstraction has 12562 states and 33072 transitions. [2022-03-15 12:51:57,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 33072 transitions. [2022-03-15 12:51:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-15 12:51:57,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:51:57,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:51:57,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 12:51:57,118 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:51:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:51:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1207381166, now seen corresponding path program 2 times [2022-03-15 12:51:57,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:51:57,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644829286] [2022-03-15 12:51:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:51:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:51:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:51:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:51:57,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:51:57,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644829286] [2022-03-15 12:51:57,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644829286] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:51:57,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:51:57,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 12:51:57,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348314585] [2022-03-15 12:51:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:51:57,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 12:51:57,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:51:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 12:51:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-03-15 12:51:57,816 INFO L87 Difference]: Start difference. First operand 12562 states and 33072 transitions. Second operand has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:51:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:51:59,890 INFO L93 Difference]: Finished difference Result 27373 states and 72376 transitions. [2022-03-15 12:51:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 12:51:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 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 122 [2022-03-15 12:51:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:51:59,935 INFO L225 Difference]: With dead ends: 27373 [2022-03-15 12:51:59,935 INFO L226 Difference]: Without dead ends: 26740 [2022-03-15 12:51:59,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=2547, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 12:51:59,936 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1071 mSDsluCounter, 7590 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 7769 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 12:51:59,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1071 Valid, 7769 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 12:51:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26740 states. [2022-03-15 12:52:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26740 to 13596. [2022-03-15 12:52:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13596 states, 13592 states have (on average 2.635741612713361) internal successors, (35825), 13595 states have internal predecessors, (35825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 35825 transitions. [2022-03-15 12:52:00,242 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 35825 transitions. Word has length 122 [2022-03-15 12:52:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:52:00,242 INFO L470 AbstractCegarLoop]: Abstraction has 13596 states and 35825 transitions. [2022-03-15 12:52:00,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 29 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 35825 transitions. [2022-03-15 12:52:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-15 12:52:00,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:52:00,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:52:00,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 12:52:00,254 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:52:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:52:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -959008282, now seen corresponding path program 3 times [2022-03-15 12:52:00,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:52:00,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672755580] [2022-03-15 12:52:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:52:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:52:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:01,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:52:01,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672755580] [2022-03-15 12:52:01,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672755580] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 12:52:01,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 12:52:01,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-03-15 12:52:01,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361057616] [2022-03-15 12:52:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:52:01,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 12:52:01,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:52:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 12:52:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-03-15 12:52:01,016 INFO L87 Difference]: Start difference. First operand 13596 states and 35825 transitions. Second operand has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:52:04,012 INFO L93 Difference]: Finished difference Result 29271 states and 77079 transitions. [2022-03-15 12:52:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 12:52:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 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 122 [2022-03-15 12:52:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:52:04,065 INFO L225 Difference]: With dead ends: 29271 [2022-03-15 12:52:04,065 INFO L226 Difference]: Without dead ends: 28458 [2022-03-15 12:52:04,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=684, Invalid=3872, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 12:52:04,067 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 1580 mSDsluCounter, 9348 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9646 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 12:52:04,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9646 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 12:52:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28458 states. [2022-03-15 12:52:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28458 to 12315. [2022-03-15 12:52:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12315 states, 12311 states have (on average 2.630899195841118) internal successors, (32389), 12314 states have internal predecessors, (32389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12315 states to 12315 states and 32389 transitions. [2022-03-15 12:52:04,335 INFO L78 Accepts]: Start accepts. Automaton has 12315 states and 32389 transitions. Word has length 122 [2022-03-15 12:52:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:52:04,335 INFO L470 AbstractCegarLoop]: Abstraction has 12315 states and 32389 transitions. [2022-03-15 12:52:04,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 12315 states and 32389 transitions. [2022-03-15 12:52:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-03-15 12:52:04,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:52:04,349 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 12:52:04,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 12:52:04,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:52:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:52:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1813794985, now seen corresponding path program 1 times [2022-03-15 12:52:04,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:52:04,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239076279] [2022-03-15 12:52:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:52:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:52:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:04,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:52:04,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239076279] [2022-03-15 12:52:04,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239076279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 12:52:04,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733972586] [2022-03-15 12:52:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:04,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:52:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:52:04,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 12:52:04,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 12:52:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:52:04,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 12:52:04,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 12:52:06,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 12:52:07,177 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 43 treesize of output 23 [2022-03-15 12:52:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:07,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 12:52:07,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 12:52:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 12:52:08,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733972586] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 12:52:08,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 12:52:08,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-03-15 12:52:08,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299577790] [2022-03-15 12:52:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 12:52:08,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 12:52:08,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:52:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 12:52:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4315, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 12:52:08,448 INFO L87 Difference]: Start difference. First operand 12315 states and 32389 transitions. Second operand has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:52:12,860 INFO L93 Difference]: Finished difference Result 32068 states and 84922 transitions. [2022-03-15 12:52:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 12:52:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 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 164 [2022-03-15 12:52:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:52:12,921 INFO L225 Difference]: With dead ends: 32068 [2022-03-15 12:52:12,921 INFO L226 Difference]: Without dead ends: 32068 [2022-03-15 12:52:12,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1532, Invalid=14980, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 12:52:12,926 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 2051 mSDsluCounter, 8776 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 9207 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 12:52:12,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 9207 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 12:52:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32068 states. [2022-03-15 12:52:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32068 to 15273. [2022-03-15 12:52:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15273 states, 15269 states have (on average 2.6509922064313316) internal successors, (40478), 15272 states have internal predecessors, (40478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 40478 transitions. [2022-03-15 12:52:13,310 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 40478 transitions. Word has length 164 [2022-03-15 12:52:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:52:13,310 INFO L470 AbstractCegarLoop]: Abstraction has 15273 states and 40478 transitions. [2022-03-15 12:52:13,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 40478 transitions. [2022-03-15 12:52:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-03-15 12:52:13,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:52:13,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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 12:52:13,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 12:52:13,545 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,SelfDestructingSolverStorable8 [2022-03-15 12:52:13,546 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:52:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:52:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1474217689, now seen corresponding path program 2 times [2022-03-15 12:52:13,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:52:13,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931353112] [2022-03-15 12:52:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:52:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:52:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:14,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:52:14,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931353112] [2022-03-15 12:52:14,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931353112] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 12:52:14,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013465245] [2022-03-15 12:52:14,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 12:52:14,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:52:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:52:14,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 12:52:14,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 12:52:14,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 12:52:14,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 12:52:14,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 12:52:14,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 12:52:14,655 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-15 12:52:14,655 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-03-15 12:52:14,666 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 12:52:14,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 11 treesize of output 11 [2022-03-15 12:52:15,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 12:52:15,583 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 58 treesize of output 54 [2022-03-15 12:52:16,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 12:52:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 12:52:16,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 12:52:17,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_244) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 12:52:17,198 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 12:52:17,198 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 29 treesize of output 30 [2022-03-15 12:52:17,205 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 12:52:17,205 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 49 treesize of output 52 [2022-03-15 12:52:17,209 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 28 treesize of output 22 [2022-03-15 12:52:18,265 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 12:52:18,265 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 12 [2022-03-15 12:52:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 12:52:18,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013465245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 12:52:18,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 12:52:18,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-03-15 12:52:18,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193962730] [2022-03-15 12:52:18,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 12:52:18,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 12:52:18,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:52:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 12:52:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 12:52:18,279 INFO L87 Difference]: Start difference. First operand 15273 states and 40478 transitions. Second operand has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:52:57,561 INFO L93 Difference]: Finished difference Result 46677 states and 123366 transitions. [2022-03-15 12:52:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 12:52:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 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 164 [2022-03-15 12:52:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:52:57,650 INFO L225 Difference]: With dead ends: 46677 [2022-03-15 12:52:57,650 INFO L226 Difference]: Without dead ends: 46677 [2022-03-15 12:52:57,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 247 ConstructedPredicates, 1 IntricatePredicates, 6 DeprecatedPredicates, 19018 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=8126, Invalid=53121, Unknown=13, NotChecked=492, Total=61752 [2022-03-15 12:52:57,658 INFO L933 BasicCegarLoop]: 997 mSDtfsCounter, 13780 mSDsluCounter, 25628 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13780 SdHoareTripleChecker+Valid, 25896 SdHoareTripleChecker+Invalid, 9005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1316 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 12:52:57,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13780 Valid, 25896 Invalid, 9005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [543 Valid, 7146 Invalid, 0 Unknown, 1316 Unchecked, 4.7s Time] [2022-03-15 12:52:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46677 states. [2022-03-15 12:52:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46677 to 16534. [2022-03-15 12:52:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16534 states, 16530 states have (on average 2.6630973986690867) internal successors, (44021), 16533 states have internal predecessors, (44021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 44021 transitions. [2022-03-15 12:52:58,089 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 44021 transitions. Word has length 164 [2022-03-15 12:52:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:52:58,090 INFO L470 AbstractCegarLoop]: Abstraction has 16534 states and 44021 transitions. [2022-03-15 12:52:58,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 5.947368421052632) internal successors, (452), 76 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 44021 transitions. [2022-03-15 12:52:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-03-15 12:52:58,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:52:58,109 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 12:52:58,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 12:52:58,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:52:58,324 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:52:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:52:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-03-15 12:52:58,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:52:58,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176192408] [2022-03-15 12:52:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:52:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:52:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:58,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:52:58,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176192408] [2022-03-15 12:52:58,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176192408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 12:52:58,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690609378] [2022-03-15 12:52:58,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 12:52:58,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:52:58,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:52:58,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 12:52:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 12:52:58,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 12:52:58,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 12:52:58,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 12:52:58,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 12:52:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:58,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 12:52:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:52:59,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690609378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 12:52:59,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 12:52:59,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 12:52:59,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455701808] [2022-03-15 12:52:59,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 12:52:59,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 12:52:59,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:52:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 12:52:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 12:52:59,153 INFO L87 Difference]: Start difference. First operand 16534 states and 44021 transitions. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 12:52:59,353 INFO L93 Difference]: Finished difference Result 26311 states and 69356 transitions. [2022-03-15 12:52:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 12:52:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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 194 [2022-03-15 12:52:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 12:52:59,402 INFO L225 Difference]: With dead ends: 26311 [2022-03-15 12:52:59,402 INFO L226 Difference]: Without dead ends: 26311 [2022-03-15 12:52:59,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2022-03-15 12:52:59,403 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 789 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 12:52:59,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 1083 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 12:52:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2022-03-15 12:52:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 21574. [2022-03-15 12:52:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21574 states, 21570 states have (on average 2.6575336114974504) internal successors, (57323), 21573 states have internal predecessors, (57323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 57323 transitions. [2022-03-15 12:52:59,764 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 57323 transitions. Word has length 194 [2022-03-15 12:52:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 12:52:59,765 INFO L470 AbstractCegarLoop]: Abstraction has 21574 states and 57323 transitions. [2022-03-15 12:52:59,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:52:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 57323 transitions. [2022-03-15 12:52:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-03-15 12:52:59,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 12:52:59,787 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, 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, 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] [2022-03-15 12:52:59,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 12:52:59,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:52:59,988 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 12:52:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 12:52:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 893496526, now seen corresponding path program 1 times [2022-03-15 12:52:59,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 12:52:59,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26299802] [2022-03-15 12:52:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:52:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 12:53:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:53:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:53:00,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 12:53:00,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26299802] [2022-03-15 12:53:00,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26299802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 12:53:00,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997563755] [2022-03-15 12:53:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 12:53:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 12:53:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 12:53:00,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 12:53:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 12:53:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 12:53:00,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-15 12:53:00,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 12:53:01,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 12:53:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 12:53:02,653 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 51 treesize of output 38 [2022-03-15 12:53:04,212 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 43 treesize of output 23 [2022-03-15 12:53:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:53:04,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 12:53:32,260 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 12:53:32,261 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 35 treesize of output 36 [2022-03-15 12:53:32,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 12:53:32,269 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 36 treesize of output 40 [2022-03-15 12:53:32,283 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 49 treesize of output 42 [2022-03-15 12:53:32,299 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 12:53:32,300 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 63 treesize of output 67 [2022-03-15 12:53:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 12:53:33,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997563755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 12:53:33,303 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 12:53:33,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-03-15 12:53:33,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004071553] [2022-03-15 12:53:33,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 12:53:33,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-15 12:53:33,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 12:53:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-15 12:53:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=7632, Unknown=23, NotChecked=0, Total=8372 [2022-03-15 12:53:33,306 INFO L87 Difference]: Start difference. First operand 21574 states and 57323 transitions. Second operand has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 12:57:19,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|))) (and (not (= 4294967294 (mod (select .cse0 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296))) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (or (and (<= c_~top~0 0) (or (<= (+ c_~top~0 1) 0) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))))) (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (forall ((v_~top~0_26 Int) (v_ArrVal_360 Int)) (or (not (< 0 v_~top~0_26)) (< (+ c_~top~0 1) v_~top~0_26) (not (= 4294967294 (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) 4) v_ArrVal_360) (+ |c_~#arr~0.offset| (* v_~top~0_26 4) (- 4))) 4294967296))))) (not (= (mod (select .cse0 (+ (* c_~top~0 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296) 4294967294)) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (forall ((v_~top~0_26 Int) (v_ArrVal_360 Int)) (or (not (< 0 v_~top~0_26)) (< c_~top~0 v_~top~0_26) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* c_~top~0 4) |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_360)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* v_~top~0_26 4) (- 4))) 4294967296))))))) is different from false [2022-03-15 12:58:59,496 WARN L228 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 13:00:45,285 WARN L228 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 13:01:20,842 WARN L228 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 13:01:48,691 WARN L228 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 13:03:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:03:39,022 INFO L93 Difference]: Finished difference Result 83914 states and 220367 transitions. [2022-03-15 13:03:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2022-03-15 13:03:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 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 199 [2022-03-15 13:03:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:03:39,182 INFO L225 Difference]: With dead ends: 83914 [2022-03-15 13:03:39,182 INFO L226 Difference]: Without dead ends: 82820 [2022-03-15 13:03:39,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 357 SyntacticMatches, 12 SemanticMatches, 292 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32500 ImplicationChecksByTransitivity, 629.0s TimeCoverageRelationStatistics Valid=6574, Invalid=78626, Unknown=360, NotChecked=582, Total=86142 [2022-03-15 13:03:39,185 INFO L933 BasicCegarLoop]: 1121 mSDtfsCounter, 6147 mSDsluCounter, 42413 mSDsCounter, 0 mSdLazyCounter, 8280 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6147 SdHoareTripleChecker+Valid, 42280 SdHoareTripleChecker+Invalid, 12972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 8280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4607 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:03:39,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6147 Valid, 42280 Invalid, 12972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 8280 Invalid, 0 Unknown, 4607 Unchecked, 4.1s Time] [2022-03-15 13:03:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82820 states. [2022-03-15 13:03:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82820 to 44488. [2022-03-15 13:03:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44488 states, 44484 states have (on average 2.704343134610197) internal successors, (120300), 44487 states have internal predecessors, (120300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 13:03:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44488 states to 44488 states and 120300 transitions. [2022-03-15 13:03:40,245 INFO L78 Accepts]: Start accepts. Automaton has 44488 states and 120300 transitions. Word has length 199 [2022-03-15 13:03:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:03:40,245 INFO L470 AbstractCegarLoop]: Abstraction has 44488 states and 120300 transitions. [2022-03-15 13:03:40,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 13:03:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 44488 states and 120300 transitions. [2022-03-15 13:03:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-03-15 13:03:40,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:03:40,289 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, 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, 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] [2022-03-15 13:03:40,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 13:03:40,491 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-03-15 13:03:40,493 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 13:03:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:03:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1411660060, now seen corresponding path program 2 times [2022-03-15 13:03:40,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:03:40,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038493499] [2022-03-15 13:03:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:03:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:03:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:03:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 13:03:41,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:03:41,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038493499] [2022-03-15 13:03:41,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038493499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 13:03:41,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94338392] [2022-03-15 13:03:41,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 13:03:41,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 13:03:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 13:03:41,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 13:03:41,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 13:03:41,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 13:03:41,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 13:03:41,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 13:03:41,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 13:03:41,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 13:03:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 13:03:42,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-15 13:03:43,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-15 13:03:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 13:03:44,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 13:03:46,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) is different from false [2022-03-15 13:04:00,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) is different from false [2022-03-15 13:04:12,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 13:04:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-03-15 13:04:13,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94338392] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 13:04:13,627 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 13:04:13,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 85 [2022-03-15 13:04:13,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747429112] [2022-03-15 13:04:13,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 13:04:13,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 13:04:13,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:04:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 13:04:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=6501, Unknown=17, NotChecked=326, Total=7140 [2022-03-15 13:04:13,629 INFO L87 Difference]: Start difference. First operand 44488 states and 120300 transitions. Second operand has 85 states, 85 states have (on average 6.670588235294118) internal successors, (567), 85 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 13:04:18,506 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse5 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= .cse4 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:04:19,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 4 .cse1) (<= 0 .cse2) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:04:22,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= 4 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-15 13:04:32,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse3 (select .cse5 0)) (.cse4 (not .cse2)) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6))) (.cse1 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:04:33,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-15 13:04:36,690 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:04:41,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_420 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-15 13:04:57,753 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse9 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse9 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse6 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) 0)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (not .cse3)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse8 (select .cse9 (+ (- 4) .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 0 |c_t2Thread1of1ForFork1_get_top_#res#1|) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= 0 .cse4) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= .cse5 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (< .cse4 4294967296) (<= 0 .cse6) (<= .cse6 4) (<= |c_t2Thread1of1ForFork1_get_top_#res#1| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse7) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 0 .cse8) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse5) (< (div .cse8 (- 4294967296)) (+ (div (+ (* (- 1) .cse8) 4) 4294967296) 1)) (= 0 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse7)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (< .cse8 4294967296)))) is different from false [2022-03-15 13:04:58,679 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse10 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse10 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| .cse1))) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (select .cse10 (+ .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|))) (.cse8 (not .cse3)) (.cse0 (select .cse9 (+ |c_~#arr~0.offset| (- 4) .cse1))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 4 .cse1) (<= 0 .cse2) .cse3 (<= 0 .cse4) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= 0 .cse5) (<= .cse6 4) (<= 0 .cse7) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (< .cse4 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse8) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< (div .cse7 (- 4294967296)) (+ (div (+ (* (- 1) .cse7) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse5 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (< .cse0 4294967296) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse6) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (< .cse7 4294967296) (or (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse8)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= .cse2 4) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:05:00,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-15 13:05:01,068 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ (* 4294967295 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967294) 4294967296) 0)) (forall ((~top~0 Int)) (let ((.cse0 (* ~top~0 4))) (= (+ .cse0 |c_~#arr~0.offset|) (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)))) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_420)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false Received shutdown request... [2022-03-15 13:06:02,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 13:06:02,155 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 13:06:03,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 13:06:03,358 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-15 13:06:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2022-03-15 13:06:03,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 501 SyntacticMatches, 10 SemanticMatches, 301 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 28278 ImplicationChecksByTransitivity, 130.2s TimeCoverageRelationStatistics Valid=7094, Invalid=76652, Unknown=116, NotChecked=7644, Total=91506 [2022-03-15 13:06:03,383 INFO L933 BasicCegarLoop]: 834 mSDtfsCounter, 9613 mSDsluCounter, 40226 mSDsCounter, 0 mSdLazyCounter, 9920 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9613 SdHoareTripleChecker+Valid, 39315 SdHoareTripleChecker+Invalid, 16236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 9920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6126 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:06:03,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9613 Valid, 39315 Invalid, 16236 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [190 Valid, 9920 Invalid, 0 Unknown, 6126 Unchecked, 6.5s Time] [2022-03-15 13:06:03,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-03-15 13:06:03,386 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 13:06:03,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 13:06:03,386 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 236 states, 85 states before enhancement),while executing Executor. [2022-03-15 13:06:03,387 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 13:06:03,387 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 13:06:03,387 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 13:06:03,388 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 13:06:03,388 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 13:06:03,389 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-03-15 13:06:03,391 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 13:06:03,391 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 13:06:03,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:06:03 BasicIcfg [2022-03-15 13:06:03,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 13:06:03,393 INFO L158 Benchmark]: Toolchain (without parser) took 857160.02ms. Allocated memory was 200.3MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 146.9MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 984.7MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,393 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 13:06:03,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 200.3MB. Free memory was 146.6MB in the beginning and 157.5MB in the end (delta: -10.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.61ms. Allocated memory is still 200.3MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,394 INFO L158 Benchmark]: Boogie Preprocessor took 34.93ms. Allocated memory is still 200.3MB. Free memory was 154.9MB in the beginning and 153.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,394 INFO L158 Benchmark]: RCFGBuilder took 337.75ms. Allocated memory is still 200.3MB. Free memory was 153.3MB in the beginning and 137.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,394 INFO L158 Benchmark]: TraceAbstraction took 856197.48ms. Allocated memory was 200.3MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 137.1MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 974.6MB. Max. memory is 8.0GB. [2022-03-15 13:06:03,400 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 200.3MB. Free memory was 146.6MB in the beginning and 157.5MB in the end (delta: -10.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.61ms. Allocated memory is still 200.3MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.93ms. Allocated memory is still 200.3MB. Free memory was 154.9MB in the beginning and 153.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 337.75ms. Allocated memory is still 200.3MB. Free memory was 153.3MB in the beginning and 137.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 856197.48ms. Allocated memory was 200.3MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 137.1MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 974.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 236 states, 85 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 236 states, 85 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 236 states, 85 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 236 states, 85 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 856.0s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 769.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37659 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37659 mSDsluCounter, 145919 SdHoareTripleChecker+Invalid, 16.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12049 IncrementalHoareTripleChecker+Unchecked, 144204 mSDsCounter, 995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34725 IncrementalHoareTripleChecker+Invalid, 47769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 995 mSolverCounterUnsat, 6485 mSDtfsCounter, 34725 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3349 GetRequests, 2133 SyntacticMatches, 28 SemanticMatches, 1187 ConstructedPredicates, 15 IntricatePredicates, 6 DeprecatedPredicates, 86980 ImplicationChecksByTransitivity, 804.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44488occurred in iteration=12, InterpolantAutomatonStates: 642, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 148434 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 78.3s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2738 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3789 ConstructedInterpolants, 101 QuantifiedInterpolants, 51982 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2135 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 156/1290 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown