/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.abstract-por-f0ea240 [2022-02-10 21:24:39,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:24:39,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:24:39,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:24:39,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:24:39,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:24:39,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:24:39,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:24:39,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:24:39,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:24:39,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:24:39,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:24:39,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:24:39,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:24:39,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:24:39,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:24:39,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:24:39,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:24:39,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:24:39,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:24:39,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:24:39,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:24:39,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:24:39,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:24:39,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:24:39,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:24:39,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:24:39,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:24:39,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:24:39,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:24:39,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:24:39,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:24:39,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:24:39,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:24:39,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:24:39,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:24:39,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:24:39,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:24:39,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:24:39,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:24:39,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:24:39,904 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-02-10 21:24:39,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:24:39,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:24:39,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:24:39,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:24:39,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:24:39,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:24:39,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:24:39,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:24:39,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:24:39,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:24:39,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:24:39,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:24:39,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:24:39,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:24:39,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:24:39,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:24:39,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:24:39,928 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-02-10 21:24:40,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:24:40,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:24:40,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:24:40,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:24:40,164 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:24:40,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-02-10 21:24:40,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878caeafd/1dbf5e5bd3014840808cfd8285c37b02/FLAGba5914b93 [2022-02-10 21:24:40,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:24:40,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-02-10 21:24:40,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878caeafd/1dbf5e5bd3014840808cfd8285c37b02/FLAGba5914b93 [2022-02-10 21:24:41,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878caeafd/1dbf5e5bd3014840808cfd8285c37b02 [2022-02-10 21:24:41,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:24:41,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:24:41,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:24:41,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:24:41,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:24:41,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299240db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41, skipping insertion in model container [2022-02-10 21:24:41,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:24:41,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:24:41,366 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-02-10 21:24:41,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:24:41,392 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:24:41,416 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-02-10 21:24:41,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:24:41,479 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:24:41,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41 WrapperNode [2022-02-10 21:24:41,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:24:41,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:24:41,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:24:41,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:24:41,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,537 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-02-10 21:24:41,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:24:41,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:24:41,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:24:41,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:24:41,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:24:41,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:24:41,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:24:41,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:24:41,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (1/1) ... [2022-02-10 21:24:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:24:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:24:41,607 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-02-10 21:24:41,614 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-02-10 21:24:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-10 21:24:41,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-10 21:24:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-10 21:24:41,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:24:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:24:41,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:24:41,636 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:24:41,731 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:24:41,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:24:41,900 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:24:41,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:24:41,907 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-10 21:24:41,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:24:41 BoogieIcfgContainer [2022-02-10 21:24:41,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:24:41,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:24:41,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:24:41,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:24:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:24:41" (1/3) ... [2022-02-10 21:24:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c0a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:24:41, skipping insertion in model container [2022-02-10 21:24:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:24:41" (2/3) ... [2022-02-10 21:24:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c0a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:24:41, skipping insertion in model container [2022-02-10 21:24:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:24:41" (3/3) ... [2022-02-10 21:24:41,914 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-02-10 21:24:41,918 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:24:41,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:24:41,918 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:24:41,918 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:24:41,959 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,959 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,960 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,961 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,962 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,963 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,964 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,965 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,966 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,967 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,967 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,967 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,967 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,968 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,969 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,970 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,971 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,972 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,973 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,973 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,973 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,974 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,974 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,974 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,974 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,974 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,975 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,976 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,976 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,976 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,976 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,977 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,978 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,979 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,980 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,980 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,980 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,980 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,981 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,982 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,983 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,984 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,984 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,984 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,984 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,984 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,985 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,986 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,987 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,988 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,989 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,990 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,990 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,990 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,991 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,992 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,993 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,994 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,994 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,994 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,995 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:41,995 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,011 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,011 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,011 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,012 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,012 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,012 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,013 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,016 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,016 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,016 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,016 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,017 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,018 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,020 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,021 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,022 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:24:42,050 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-10 21:24:42,094 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:24:42,101 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:24:42,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-10 21:24:42,119 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 176 transitions, 368 flow [2022-02-10 21:24:42,389 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-02-10 21:24:42,432 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-02-10 21:24:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-10 21:24:42,458 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:42,458 INFO L515 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-02-10 21:24:42,459 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-02-10 21:24:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-02-10 21:24:42,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:42,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640958278] [2022-02-10 21:24:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:42,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:42,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640958278] [2022-02-10 21:24:42,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640958278] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:42,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:42,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 21:24:42,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590842608] [2022-02-10 21:24:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:42,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:24:42,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:24:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:24:42,809 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-02-10 21:24:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:43,259 INFO L93 Difference]: Finished difference Result 15687 states and 43137 transitions. [2022-02-10 21:24:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:24:43,262 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-02-10 21:24:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:43,368 INFO L225 Difference]: With dead ends: 15687 [2022-02-10 21:24:43,368 INFO L226 Difference]: Without dead ends: 15411 [2022-02-10 21:24:43,370 INFO L933 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-02-10 21:24:43,375 INFO L934 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-02-10 21:24:43,377 INFO L935 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-02-10 21:24:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15411 states. [2022-02-10 21:24:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15411 to 14887. [2022-02-10 21:24:43,875 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-02-10 21:24:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 41179 transitions. [2022-02-10 21:24:43,931 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 41179 transitions. Word has length 65 [2022-02-10 21:24:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:43,933 INFO L470 AbstractCegarLoop]: Abstraction has 14887 states and 41179 transitions. [2022-02-10 21:24:43,934 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-02-10 21:24:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 41179 transitions. [2022-02-10 21:24:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-10 21:24:43,942 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:43,942 INFO L515 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-02-10 21:24:43,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:24:43,943 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-02-10 21:24:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-02-10 21:24:43,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:43,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300654132] [2022-02-10 21:24:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:44,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:44,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300654132] [2022-02-10 21:24:44,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300654132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:44,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:44,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 21:24:44,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444225185] [2022-02-10 21:24:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:44,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 21:24:44,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 21:24:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-10 21:24:44,072 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-02-10 21:24:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:44,368 INFO L93 Difference]: Finished difference Result 22347 states and 61714 transitions. [2022-02-10 21:24:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-10 21:24:44,369 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-02-10 21:24:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:44,445 INFO L225 Difference]: With dead ends: 22347 [2022-02-10 21:24:44,445 INFO L226 Difference]: Without dead ends: 22347 [2022-02-10 21:24:44,448 INFO L933 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-02-10 21:24:44,449 INFO L934 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-02-10 21:24:44,449 INFO L935 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-02-10 21:24:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2022-02-10 21:24:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 16015. [2022-02-10 21:24:45,165 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-02-10 21:24:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 44295 transitions. [2022-02-10 21:24:45,230 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 44295 transitions. Word has length 81 [2022-02-10 21:24:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:45,233 INFO L470 AbstractCegarLoop]: Abstraction has 16015 states and 44295 transitions. [2022-02-10 21:24:45,233 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-02-10 21:24:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 44295 transitions. [2022-02-10 21:24:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-10 21:24:45,244 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:45,244 INFO L515 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-02-10 21:24:45,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:24:45,245 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-02-10 21:24:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 235148469, now seen corresponding path program 1 times [2022-02-10 21:24:45,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:45,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176293139] [2022-02-10 21:24:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:45,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:45,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176293139] [2022-02-10 21:24:45,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176293139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:45,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:45,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 21:24:45,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164377357] [2022-02-10 21:24:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:45,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:24:45,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:24:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:24:45,330 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-02-10 21:24:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:45,574 INFO L93 Difference]: Finished difference Result 24457 states and 67330 transitions. [2022-02-10 21:24:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:24:45,575 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-02-10 21:24:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:45,645 INFO L225 Difference]: With dead ends: 24457 [2022-02-10 21:24:45,645 INFO L226 Difference]: Without dead ends: 24457 [2022-02-10 21:24:45,645 INFO L933 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-02-10 21:24:45,646 INFO L934 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-02-10 21:24:45,647 INFO L935 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-02-10 21:24:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24457 states. [2022-02-10 21:24:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24457 to 22373. [2022-02-10 21:24:46,185 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-02-10 21:24:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 61952 transitions. [2022-02-10 21:24:46,351 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 61952 transitions. Word has length 99 [2022-02-10 21:24:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:46,356 INFO L470 AbstractCegarLoop]: Abstraction has 22373 states and 61952 transitions. [2022-02-10 21:24:46,356 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-02-10 21:24:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 61952 transitions. [2022-02-10 21:24:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 21:24:46,370 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:46,371 INFO L515 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-02-10 21:24:46,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:24:46,371 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-02-10 21:24:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-02-10 21:24:46,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:46,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499276520] [2022-02-10 21:24:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:46,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:46,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499276520] [2022-02-10 21:24:46,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499276520] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:24:46,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462500526] [2022-02-10 21:24:46,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:24:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:24:46,481 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-02-10 21:24:46,482 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-02-10 21:24:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:46,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 21:24:46,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:24:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:46,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:24:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:47,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462500526] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 21:24:47,020 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 21:24:47,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 21:24:47,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841302984] [2022-02-10 21:24:47,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 21:24:47,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:24:47,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:24:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:24:47,022 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-02-10 21:24:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:47,438 INFO L93 Difference]: Finished difference Result 43271 states and 119230 transitions. [2022-02-10 21:24:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 21:24:47,438 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-02-10 21:24:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:47,562 INFO L225 Difference]: With dead ends: 43271 [2022-02-10 21:24:47,562 INFO L226 Difference]: Without dead ends: 43119 [2022-02-10 21:24:47,562 INFO L933 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-02-10 21:24:47,568 INFO L934 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.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:24:47,569 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 1276 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:24:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43119 states. [2022-02-10 21:24:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43119 to 35319. [2022-02-10 21:24:48,607 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-02-10 21:24:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 98561 transitions. [2022-02-10 21:24:48,721 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 98561 transitions. Word has length 110 [2022-02-10 21:24:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:48,722 INFO L470 AbstractCegarLoop]: Abstraction has 35319 states and 98561 transitions. [2022-02-10 21:24:48,722 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-02-10 21:24:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 98561 transitions. [2022-02-10 21:24:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-10 21:24:48,737 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:48,737 INFO L515 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-02-10 21:24:48,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-10 21:24:48,955 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-02-10 21:24:48,956 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-02-10 21:24:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -154454040, now seen corresponding path program 1 times [2022-02-10 21:24:48,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:48,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2635492] [2022-02-10 21:24:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:49,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:49,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2635492] [2022-02-10 21:24:49,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2635492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:49,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:49,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 21:24:49,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302844646] [2022-02-10 21:24:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:49,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:24:49,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:24:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:24:49,002 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-02-10 21:24:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:49,053 INFO L93 Difference]: Finished difference Result 11357 states and 29882 transitions. [2022-02-10 21:24:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:24:49,053 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-02-10 21:24:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:49,077 INFO L225 Difference]: With dead ends: 11357 [2022-02-10 21:24:49,077 INFO L226 Difference]: Without dead ends: 11319 [2022-02-10 21:24:49,077 INFO L933 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-02-10 21:24:49,078 INFO L934 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-02-10 21:24:49,078 INFO L935 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-02-10 21:24:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2022-02-10 21:24:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 9775. [2022-02-10 21:24:49,488 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-02-10 21:24:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 25474 transitions. [2022-02-10 21:24:49,507 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 25474 transitions. Word has length 113 [2022-02-10 21:24:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:49,507 INFO L470 AbstractCegarLoop]: Abstraction has 9775 states and 25474 transitions. [2022-02-10 21:24:49,507 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-02-10 21:24:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 25474 transitions. [2022-02-10 21:24:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-10 21:24:49,519 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:49,519 INFO L515 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-02-10 21:24:49,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:24:49,519 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-02-10 21:24:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1480826348, now seen corresponding path program 1 times [2022-02-10 21:24:49,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:49,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051546274] [2022-02-10 21:24:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:50,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:50,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051546274] [2022-02-10 21:24:50,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051546274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:50,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:50,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-10 21:24:50,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906896630] [2022-02-10 21:24:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:50,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-10 21:24:50,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-10 21:24:50,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-02-10 21:24:50,121 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-02-10 21:24:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:52,628 INFO L93 Difference]: Finished difference Result 24261 states and 63753 transitions. [2022-02-10 21:24:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-10 21:24:52,629 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-02-10 21:24:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:52,676 INFO L225 Difference]: With dead ends: 24261 [2022-02-10 21:24:52,676 INFO L226 Difference]: Without dead ends: 23418 [2022-02-10 21:24:52,677 INFO L933 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-02-10 21:24:52,678 INFO L934 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.8s IncrementalHoareTripleChecker+Time [2022-02-10 21:24:52,678 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1242 Valid, 7914 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-10 21:24:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23418 states. [2022-02-10 21:24:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23418 to 12562. [2022-02-10 21:24:52,942 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-02-10 21:24:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 33072 transitions. [2022-02-10 21:24:52,968 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 33072 transitions. Word has length 122 [2022-02-10 21:24:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:52,968 INFO L470 AbstractCegarLoop]: Abstraction has 12562 states and 33072 transitions. [2022-02-10 21:24:52,968 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-02-10 21:24:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 33072 transitions. [2022-02-10 21:24:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-10 21:24:52,981 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:52,981 INFO L515 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-02-10 21:24:52,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:24:52,981 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-02-10 21:24:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1207381166, now seen corresponding path program 2 times [2022-02-10 21:24:52,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:52,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105496220] [2022-02-10 21:24:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:53,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:53,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105496220] [2022-02-10 21:24:53,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105496220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:53,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:53,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:24:53,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194023682] [2022-02-10 21:24:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:53,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:24:53,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:24:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:24:53,732 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-02-10 21:24:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:24:55,924 INFO L93 Difference]: Finished difference Result 27373 states and 72376 transitions. [2022-02-10 21:24:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-10 21:24:55,925 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-02-10 21:24:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:24:55,982 INFO L225 Difference]: With dead ends: 27373 [2022-02-10 21:24:55,983 INFO L226 Difference]: Without dead ends: 26740 [2022-02-10 21:24:55,983 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=423, Invalid=2547, Unknown=0, NotChecked=0, Total=2970 [2022-02-10 21:24:55,984 INFO L934 BasicCegarLoop]: 431 mSDtfsCounter, 1071 mSDsluCounter, 7590 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-02-10 21:24:55,984 INFO L935 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-02-10 21:24:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26740 states. [2022-02-10 21:24:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26740 to 13596. [2022-02-10 21:24:56,298 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-02-10 21:24:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 35825 transitions. [2022-02-10 21:24:56,330 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 35825 transitions. Word has length 122 [2022-02-10 21:24:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:24:56,330 INFO L470 AbstractCegarLoop]: Abstraction has 13596 states and 35825 transitions. [2022-02-10 21:24:56,330 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-02-10 21:24:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 35825 transitions. [2022-02-10 21:24:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-10 21:24:56,344 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:24:56,344 INFO L515 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-02-10 21:24:56,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:24:56,345 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-02-10 21:24:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:24:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash -959008282, now seen corresponding path program 3 times [2022-02-10 21:24:56,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:24:56,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34707840] [2022-02-10 21:24:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:24:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:24:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:24:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:24:57,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:24:57,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34707840] [2022-02-10 21:24:57,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34707840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:24:57,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:24:57,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-02-10 21:24:57,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817841210] [2022-02-10 21:24:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:24:57,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-10 21:24:57,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:24:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-10 21:24:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-02-10 21:24:57,218 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-02-10 21:25:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:25:00,304 INFO L93 Difference]: Finished difference Result 29271 states and 77079 transitions. [2022-02-10 21:25:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-10 21:25:00,305 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-02-10 21:25:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:25:00,417 INFO L225 Difference]: With dead ends: 29271 [2022-02-10 21:25:00,418 INFO L226 Difference]: Without dead ends: 28458 [2022-02-10 21:25:00,419 INFO L933 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-02-10 21:25:00,420 INFO L934 BasicCegarLoop]: 584 mSDtfsCounter, 1580 mSDsluCounter, 9348 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:25:00,420 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 9646 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-10 21:25:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28458 states. [2022-02-10 21:25:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28458 to 12315. [2022-02-10 21:25:00,659 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-02-10 21:25:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12315 states to 12315 states and 32389 transitions. [2022-02-10 21:25:00,681 INFO L78 Accepts]: Start accepts. Automaton has 12315 states and 32389 transitions. Word has length 122 [2022-02-10 21:25:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:25:00,682 INFO L470 AbstractCegarLoop]: Abstraction has 12315 states and 32389 transitions. [2022-02-10 21:25:00,682 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-02-10 21:25:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12315 states and 32389 transitions. [2022-02-10 21:25:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-10 21:25:00,696 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:25:00,696 INFO L515 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-02-10 21:25:00,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:25:00,696 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-02-10 21:25:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:25:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1813794985, now seen corresponding path program 1 times [2022-02-10 21:25:00,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:25:00,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531368126] [2022-02-10 21:25:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:25:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:01,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:25:01,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531368126] [2022-02-10 21:25:01,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531368126] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:25:01,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161273468] [2022-02-10 21:25:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:01,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:25:01,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:25:01,399 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-02-10 21:25:01,400 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-02-10 21:25:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:01,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-10 21:25:01,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:25:02,691 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-02-10 21:25:03,583 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-02-10 21:25:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:03,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:25:04,307 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-02-10 21:25:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-10 21:25:04,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161273468] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-10 21:25:04,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-10 21:25:04,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-02-10 21:25:04,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863845294] [2022-02-10 21:25:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:25:04,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 21:25:04,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:25:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 21:25:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4315, Unknown=0, NotChecked=0, Total=4556 [2022-02-10 21:25:04,878 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-02-10 21:25:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:25:09,469 INFO L93 Difference]: Finished difference Result 32068 states and 84922 transitions. [2022-02-10 21:25:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 21:25:09,470 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-02-10 21:25:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:25:09,534 INFO L225 Difference]: With dead ends: 32068 [2022-02-10 21:25:09,534 INFO L226 Difference]: Without dead ends: 32068 [2022-02-10 21:25:09,538 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1532, Invalid=14980, Unknown=0, NotChecked=0, Total=16512 [2022-02-10 21:25:09,539 INFO L934 BasicCegarLoop]: 666 mSDtfsCounter, 2051 mSDsluCounter, 8776 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-02-10 21:25:09,539 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 9207 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-10 21:25:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32068 states. [2022-02-10 21:25:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32068 to 15273. [2022-02-10 21:25:09,919 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-02-10 21:25:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 40478 transitions. [2022-02-10 21:25:09,951 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 40478 transitions. Word has length 164 [2022-02-10 21:25:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:25:09,952 INFO L470 AbstractCegarLoop]: Abstraction has 15273 states and 40478 transitions. [2022-02-10 21:25:09,952 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-02-10 21:25:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 40478 transitions. [2022-02-10 21:25:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-10 21:25:09,969 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:25:09,969 INFO L515 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-02-10 21:25:09,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 21:25:10,185 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-02-10 21:25:10,186 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-02-10 21:25:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:25:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1474217689, now seen corresponding path program 2 times [2022-02-10 21:25:10,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:25:10,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588998960] [2022-02-10 21:25:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:25:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:11,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:25:11,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588998960] [2022-02-10 21:25:11,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588998960] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:25:11,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728468339] [2022-02-10 21:25:11,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 21:25:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:25:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:25:11,179 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-02-10 21:25:11,180 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-02-10 21:25:11,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 21:25:11,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 21:25:11,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-10 21:25:11,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:25:11,433 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 21:25:11,434 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-02-10 21:25:11,445 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 21:25:11,446 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-02-10 21:25:12,312 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-02-10 21:25:12,402 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-02-10 21:25:13,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-02-10 21:25:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-10 21:25:13,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:25:14,159 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-02-10 21:25:14,168 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 21:25:14,168 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-02-10 21:25:14,178 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 21:25:14,179 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-02-10 21:25:14,201 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-02-10 21:25:15,071 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-10 21:25:15,071 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-02-10 21:25:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-10 21:25:15,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728468339] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 21:25:15,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 21:25:15,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 76 [2022-02-10 21:25:15,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425176579] [2022-02-10 21:25:15,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 21:25:15,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-02-10 21:25:15,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:25:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-02-10 21:25:15,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=5275, Unknown=1, NotChecked=146, Total=5700 [2022-02-10 21:25:15,086 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-02-10 21:25:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:25:53,302 INFO L93 Difference]: Finished difference Result 46677 states and 123366 transitions. [2022-02-10 21:25:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-02-10 21:25:53,303 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-02-10 21:25:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:25:53,393 INFO L225 Difference]: With dead ends: 46677 [2022-02-10 21:25:53,393 INFO L226 Difference]: Without dead ends: 46677 [2022-02-10 21:25:53,400 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 247 ConstructedPredicates, 1 IntricatePredicates, 6 DeprecatedPredicates, 19018 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=8126, Invalid=53121, Unknown=13, NotChecked=492, Total=61752 [2022-02-10 21:25:53,400 INFO L934 BasicCegarLoop]: 997 mSDtfsCounter, 13780 mSDsluCounter, 25628 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:25:53,400 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [13780 Valid, 25896 Invalid, 9005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [543 Valid, 7146 Invalid, 0 Unknown, 1316 Unchecked, 4.5s Time] [2022-02-10 21:25:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46677 states. [2022-02-10 21:25:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46677 to 16534. [2022-02-10 21:25:53,821 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-02-10 21:25:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 44021 transitions. [2022-02-10 21:25:53,853 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 44021 transitions. Word has length 164 [2022-02-10 21:25:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:25:53,853 INFO L470 AbstractCegarLoop]: Abstraction has 16534 states and 44021 transitions. [2022-02-10 21:25:53,853 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-02-10 21:25:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 44021 transitions. [2022-02-10 21:25:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-02-10 21:25:53,873 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:25:53,873 INFO L515 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-02-10 21:25:53,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-10 21:25:54,091 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-02-10 21:25:54,092 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-02-10 21:25:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:25:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-02-10 21:25:54,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:25:54,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442276674] [2022-02-10 21:25:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:25:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:54,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:25:54,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442276674] [2022-02-10 21:25:54,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442276674] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:25:54,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867906159] [2022-02-10 21:25:54,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 21:25:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:25:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:25:54,180 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-02-10 21:25:54,181 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-02-10 21:25:54,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 21:25:54,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 21:25:54,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 21:25:54,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:25:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:54,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:25:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:54,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867906159] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 21:25:54,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 21:25:54,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-10 21:25:54,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039411688] [2022-02-10 21:25:54,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 21:25:54,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-10 21:25:54,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:25:54,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-10 21:25:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:25:54,987 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-02-10 21:25:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:25:55,309 INFO L93 Difference]: Finished difference Result 26311 states and 69356 transitions. [2022-02-10 21:25:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 21:25:55,309 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-02-10 21:25:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:25:55,357 INFO L225 Difference]: With dead ends: 26311 [2022-02-10 21:25:55,357 INFO L226 Difference]: Without dead ends: 26311 [2022-02-10 21:25:55,357 INFO L933 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-02-10 21:25:55,358 INFO L934 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-02-10 21:25:55,358 INFO L935 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-02-10 21:25:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2022-02-10 21:25:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 21574. [2022-02-10 21:25:55,685 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-02-10 21:25:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 57323 transitions. [2022-02-10 21:25:55,730 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 57323 transitions. Word has length 194 [2022-02-10 21:25:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:25:55,730 INFO L470 AbstractCegarLoop]: Abstraction has 21574 states and 57323 transitions. [2022-02-10 21:25:55,731 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-02-10 21:25:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 57323 transitions. [2022-02-10 21:25:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-02-10 21:25:55,753 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:25:55,753 INFO L515 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-02-10 21:25:55,769 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-02-10 21:25:55,968 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-02-10 21:25:55,969 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-10 21:25:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:25:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash 893496526, now seen corresponding path program 1 times [2022-02-10 21:25:55,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:25:55,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476007945] [2022-02-10 21:25:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:25:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:56,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:25:56,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476007945] [2022-02-10 21:25:56,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476007945] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:25:56,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028621945] [2022-02-10 21:25:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:25:56,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:25:56,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:25:56,900 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-02-10 21:25:56,901 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-02-10 21:25:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:25:56,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-10 21:25:57,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:25:57,974 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-02-10 21:25:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 21:25:58,750 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-02-10 21:25:59,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 43 treesize of output 23 [2022-02-10 21:25:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:25:59,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:26:27,585 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 21:26:27,585 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-02-10 21:26:27,592 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 21:26:27,593 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-02-10 21:26:27,605 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-02-10 21:26:27,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 21:26:27,620 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-02-10 21:26:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:26:28,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028621945] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 21:26:28,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 21:26:28,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-02-10 21:26:28,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960853359] [2022-02-10 21:26:28,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 21:26:28,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-02-10 21:26:28,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:26:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-02-10 21:26:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=7632, Unknown=23, NotChecked=0, Total=8372 [2022-02-10 21:26:28,568 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-02-10 21:30:05,220 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-02-10 21:33:44,372 WARN L228 SmtUtils]: Spent 5.36s 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-02-10 21:34:19,001 WARN L228 SmtUtils]: Spent 10.42s 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-02-10 21:34:48,246 WARN L228 SmtUtils]: Spent 10.75s 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-02-10 21:36:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:36:22,272 INFO L93 Difference]: Finished difference Result 83914 states and 220367 transitions. [2022-02-10 21:36:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2022-02-10 21:36:22,272 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-02-10 21:36:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:36:22,442 INFO L225 Difference]: With dead ends: 83914 [2022-02-10 21:36:22,442 INFO L226 Difference]: Without dead ends: 82820 [2022-02-10 21:36:22,447 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 357 SyntacticMatches, 12 SemanticMatches, 292 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32528 ImplicationChecksByTransitivity, 617.0s TimeCoverageRelationStatistics Valid=6586, Invalid=78629, Unknown=345, NotChecked=582, Total=86142 [2022-02-10 21:36:22,448 INFO L934 BasicCegarLoop]: 1121 mSDtfsCounter, 6148 mSDsluCounter, 42405 mSDsCounter, 0 mSdLazyCounter, 8280 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6148 SdHoareTripleChecker+Valid, 42260 SdHoareTripleChecker+Invalid, 12977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 8280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4612 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:36:22,448 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6148 Valid, 42260 Invalid, 12977 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 8280 Invalid, 0 Unknown, 4612 Unchecked, 3.9s Time] [2022-02-10 21:36:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82820 states. [2022-02-10 21:36:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82820 to 44488. [2022-02-10 21:36:23,981 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-02-10 21:36:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44488 states to 44488 states and 120300 transitions. [2022-02-10 21:36:24,077 INFO L78 Accepts]: Start accepts. Automaton has 44488 states and 120300 transitions. Word has length 199 [2022-02-10 21:36:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:36:24,078 INFO L470 AbstractCegarLoop]: Abstraction has 44488 states and 120300 transitions. [2022-02-10 21:36:24,078 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-02-10 21:36:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44488 states and 120300 transitions. [2022-02-10 21:36:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-02-10 21:36:24,124 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:36:24,124 INFO L515 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-02-10 21:36:24,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-10 21:36:24,339 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-02-10 21:36:24,340 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-02-10 21:36:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:36:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1411660060, now seen corresponding path program 2 times [2022-02-10 21:36:24,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:36:24,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929072143] [2022-02-10 21:36:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:36:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:36:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:36:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 21:36:25,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:36:25,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929072143] [2022-02-10 21:36:25,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929072143] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 21:36:25,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305418914] [2022-02-10 21:36:25,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 21:36:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:36:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:36:25,296 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-02-10 21:36:25,297 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-02-10 21:36:25,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 21:36:25,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 21:36:25,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-10 21:36:25,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 21:36:25,993 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-02-10 21:36:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 21:36:26,932 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-02-10 21:36:28,308 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-02-10 21:36:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 21:36:28,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 21:36:31,110 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-02-10 21:36:31,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) is different from false [2022-02-10 21:36:53,325 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-02-10 21:36:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-02-10 21:36:53,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305418914] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 21:36:53,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 21:36:53,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 85 [2022-02-10 21:36:53,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845859340] [2022-02-10 21:36:53,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 21:36:53,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-10 21:36:53,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:36:53,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-10 21:36:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=6514, Unknown=7, NotChecked=326, Total=7140 [2022-02-10 21:36:53,977 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-02-10 21:36:58,962 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse4) (<= |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-02-10 21:36:59,617 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse2 (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) .cse1)))) (and (<= 0 .cse0) (<= 4 .cse1) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1))))) is different from false [2022-02-10 21:37:02,514 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) (<= 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 .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)))) is different from false [2022-02-10 21:37:13,316 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (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-02-10 21:37:14,075 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-02-10 21:37:17,114 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-10 21:37:19,192 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|) (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) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-02-10 21:37:52,094 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .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|) (= |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_~#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-02-10 21:37:53,052 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .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) (< (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_~#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-02-10 21:37:55,104 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_420 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_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)))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (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-02-10 21:38:31,424 WARN L228 SmtUtils]: Spent 8.91s on a formula simplification. DAG size of input: 66 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-02-10 21:39:12,071 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-02-10 21:39:12,071 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-02-10 21:39:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2022-02-10 21:39:12,269 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 495 SyntacticMatches, 11 SemanticMatches, 278 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 23772 ImplicationChecksByTransitivity, 134.7s TimeCoverageRelationStatistics Valid=6661, Invalid=64874, Unknown=69, NotChecked=6516, Total=78120 [2022-02-10 21:39:12,270 INFO L934 BasicCegarLoop]: 859 mSDtfsCounter, 9616 mSDsluCounter, 39162 mSDsCounter, 0 mSdLazyCounter, 9721 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9616 SdHoareTripleChecker+Valid, 38350 SdHoareTripleChecker+Invalid, 14972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 9721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5074 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:39:12,270 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9616 Valid, 38350 Invalid, 14972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [177 Valid, 9721 Invalid, 0 Unknown, 5074 Unchecked, 6.2s Time] [2022-02-10 21:39:12,271 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-10 21:39:12,293 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-02-10 21:39:12,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 21:39:12,479 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (44488states) and FLOYD_HOARE automaton (currently 208 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 280 known predicates. [2022-02-10 21:39:12,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-02-10 21:39:12,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-02-10 21:39:12,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-10 21:39:12,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-10 21:39:12,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-10 21:39:12,483 INFO L733 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-02-10 21:39:12,485 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:39:12,486 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:39:12,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:39:12 BasicIcfg [2022-02-10 21:39:12,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:39:12,529 INFO L158 Benchmark]: Toolchain (without parser) took 871508.08ms. Allocated memory was 207.6MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 149.5MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-02-10 21:39:12,529 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:39:12,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.79ms. Allocated memory was 207.6MB in the beginning and 347.1MB in the end (delta: 139.5MB). Free memory was 149.3MB in the beginning and 298.8MB in the end (delta: -149.5MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2022-02-10 21:39:12,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.54ms. Allocated memory is still 347.1MB. Free memory was 298.8MB in the beginning and 296.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:39:12,530 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 347.1MB. Free memory was 296.2MB in the beginning and 294.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 21:39:12,530 INFO L158 Benchmark]: RCFGBuilder took 333.33ms. Allocated memory is still 347.1MB. Free memory was 294.1MB in the beginning and 277.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-10 21:39:12,530 INFO L158 Benchmark]: TraceAbstraction took 870619.20ms. Allocated memory was 347.1MB in the beginning and 5.2GB in the end (delta: 4.8GB). Free memory was 277.3MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-02-10 21:39:12,531 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.11ms. Allocated memory is still 207.6MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.79ms. Allocated memory was 207.6MB in the beginning and 347.1MB in the end (delta: 139.5MB). Free memory was 149.3MB in the beginning and 298.8MB in the end (delta: -149.5MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.54ms. Allocated memory is still 347.1MB. Free memory was 298.8MB in the beginning and 296.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 347.1MB. Free memory was 296.2MB in the beginning and 294.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.33ms. Allocated memory is still 347.1MB. Free memory was 294.1MB in the beginning and 277.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 870619.20ms. Allocated memory was 347.1MB in the beginning and 5.2GB in the end (delta: 4.8GB). Free memory was 277.3MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 1.3GB. 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 208 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 280 known predicates. - 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 208 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 280 known predicates. - 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 208 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 280 known predicates. - 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 208 states, 85 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 280 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 870.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 785.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37663 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37663 mSDsluCounter, 144934 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11002 IncrementalHoareTripleChecker+Unchecked, 143132 mSDsCounter, 982 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34526 IncrementalHoareTripleChecker+Invalid, 46510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 982 mSolverCounterUnsat, 6510 mSDtfsCounter, 34526 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3321 GetRequests, 2127 SyntacticMatches, 29 SemanticMatches, 1164 ConstructedPredicates, 14 IntricatePredicates, 6 DeprecatedPredicates, 82502 ImplicationChecksByTransitivity, 796.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: 7.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 148434 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 74.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