/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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-10 10:40:23,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-10 10:40:23,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-10 10:40:23,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-10 10:40:23,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-10 10:40:23,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-10 10:40:23,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-10 10:40:23,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-10 10:40:23,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-10 10:40:23,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-10 10:40:23,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-10 10:40:23,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-10 10:40:23,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-10 10:40:23,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-10 10:40:23,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-10 10:40:23,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-10 10:40:23,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-10 10:40:23,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-10 10:40:23,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-10 10:40:23,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-10 10:40:23,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-10 10:40:23,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-10 10:40:23,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-10 10:40:23,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-10 10:40:23,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-10 10:40:23,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-10 10:40:23,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-10 10:40:23,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-10 10:40:23,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-10 10:40:23,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-10 10:40:23,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-10 10:40:23,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-10 10:40:23,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-10 10:40:23,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-10 10:40:23,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-10 10:40:23,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-10 10:40:23,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-10 10:40:23,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-10 10:40:23,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-10 10:40:23,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-10 10:40:23,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-10 10:40:23,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2021-07-10 10:40:23,128 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-10 10:40:23,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-10 10:40:23,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-10 10:40:23,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-10 10:40:23,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-10 10:40:23,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-10 10:40:23,131 INFO L138 SettingsManager]: * Use SBE=true [2021-07-10 10:40:23,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-10 10:40:23,131 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-10 10:40:23,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-10 10:40:23,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-10 10:40:23,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-10 10:40:23,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-10 10:40:23,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-10 10:40:23,134 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-07-10 10:40:23,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-10 10:40:23,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-10 10:40:23,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-10 10:40:23,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-10 10:40:23,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-10 10:40:23,415 INFO L275 PluginConnector]: CDTParser initialized [2021-07-10 10:40:23,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-07-10 10:40:23,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527271c59/c58ed27dddce49cba3db70e0b8513c04/FLAG9833909af [2021-07-10 10:40:23,851 INFO L306 CDTParser]: Found 1 translation units. [2021-07-10 10:40:23,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-07-10 10:40:23,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527271c59/c58ed27dddce49cba3db70e0b8513c04/FLAG9833909af [2021-07-10 10:40:24,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527271c59/c58ed27dddce49cba3db70e0b8513c04 [2021-07-10 10:40:24,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-10 10:40:24,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-10 10:40:24,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-10 10:40:24,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-10 10:40:24,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-10 10:40:24,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cde6865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24, skipping insertion in model container [2021-07-10 10:40:24,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-10 10:40:24,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-10 10:40:24,576 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41060,41073] [2021-07-10 10:40:24,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-10 10:40:24,628 INFO L203 MainTranslator]: Completed pre-run [2021-07-10 10:40:24,657 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41060,41073] [2021-07-10 10:40:24,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-10 10:40:24,702 INFO L208 MainTranslator]: Completed translation [2021-07-10 10:40:24,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24 WrapperNode [2021-07-10 10:40:24,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-10 10:40:24,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-10 10:40:24,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-10 10:40:24,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-10 10:40:24,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-10 10:40:24,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-10 10:40:24,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-10 10:40:24,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-10 10:40:24,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... [2021-07-10 10:40:24,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-10 10:40:24,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-10 10:40:24,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-10 10:40:24,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-10 10:40:24,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-07-10 10:40:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-07-10 10:40:24,872 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-07-10 10:40:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-10 10:40:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-10 10:40:24,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-10 10:40:24,873 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-10 10:40:25,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-10 10:40:25,258 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-07-10 10:40:25,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 10:40:25 BoogieIcfgContainer [2021-07-10 10:40:25,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-10 10:40:25,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-10 10:40:25,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-10 10:40:25,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-10 10:40:25,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 10:40:24" (1/3) ... [2021-07-10 10:40:25,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17465e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 10:40:25, skipping insertion in model container [2021-07-10 10:40:25,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 10:40:24" (2/3) ... [2021-07-10 10:40:25,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17465e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 10:40:25, skipping insertion in model container [2021-07-10 10:40:25,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 10:40:25" (3/3) ... [2021-07-10 10:40:25,264 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2021-07-10 10:40:25,268 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-10 10:40:25,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-10 10:40:25,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-07-10 10:40:25,268 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-10 10:40:25,288 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,288 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,292 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,293 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,297 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,298 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,299 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,300 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,301 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,302 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,303 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,307 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:40:25,310 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-07-10 10:40:25,325 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-07-10 10:40:25,379 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-10 10:40:25,379 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-10 10:40:25,379 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-10 10:40:25,380 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-10 10:40:25,380 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-10 10:40:25,380 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-10 10:40:25,380 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-10 10:40:25,380 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-07-10 10:40:25,832 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2085876481, now seen corresponding path program 1 times [2021-07-10 10:40:25,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:25,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124298994] [2021-07-10 10:40:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2021-07-10 10:40:26,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:26,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124298994] [2021-07-10 10:40:26,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124298994] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-10 10:40:26,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-10 10:40:26,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-10 10:40:26,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601151668] [2021-07-10 10:40:26,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-10 10:40:26,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-10 10:40:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-10 10:40:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,077 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:26,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:26,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,095 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-10 10:40:26,095 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 213975870, now seen corresponding path program 1 times [2021-07-10 10:40:26,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:26,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401638243] [2021-07-10 10:40:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2021-07-10 10:40:26,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:26,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401638243] [2021-07-10 10:40:26,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401638243] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-10 10:40:26,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-10 10:40:26,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-10 10:40:26,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061990815] [2021-07-10 10:40:26,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-10 10:40:26,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-10 10:40:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-10 10:40:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,169 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:26,169 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:26,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:26,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-10 10:40:26,194 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1272609701, now seen corresponding path program 1 times [2021-07-10 10:40:26,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:26,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97126221] [2021-07-10 10:40:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2021-07-10 10:40:26,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:26,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97126221] [2021-07-10 10:40:26,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97126221] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:26,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298225979] [2021-07-10 10:40:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:26,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-10 10:40:26,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-07-10 10:40:26,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298225979] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-10 10:40:26,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-10 10:40:26,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-10 10:40:26,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179714648] [2021-07-10 10:40:26,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-10 10:40:26,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-10 10:40:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-10 10:40:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,985 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:26,985 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:26,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:27,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:27,353 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1592302975, now seen corresponding path program 1 times [2021-07-10 10:40:27,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:27,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725641014] [2021-07-10 10:40:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2021-07-10 10:40:27,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:27,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725641014] [2021-07-10 10:40:27,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725641014] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:27,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582063059] [2021-07-10 10:40:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:27,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-10 10:40:27,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:27,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-07-10 10:40:27,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:27,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:27,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:27,802 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-07-10 10:40:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2021-07-10 10:40:28,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582063059] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-10 10:40:28,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-10 10:40:28,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-10 10:40:28,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403891721] [2021-07-10 10:40:28,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-10 10:40:28,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-10 10:40:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-10 10:40:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:28,141 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:28,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:28,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:28,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:28,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:28,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:28,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:28,429 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2080441729, now seen corresponding path program 2 times [2021-07-10 10:40:28,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:28,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153506767] [2021-07-10 10:40:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2021-07-10 10:40:28,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:28,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153506767] [2021-07-10 10:40:28,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153506767] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:28,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694957231] [2021-07-10 10:40:28,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:28,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-10 10:40:28,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:40:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-10 10:40:28,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2021-07-10 10:40:29,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694957231] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:29,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:40:29,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-10 10:40:29,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412992348] [2021-07-10 10:40:29,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-10 10:40:29,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-10 10:40:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-10 10:40:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,040 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:29,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:29,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:29,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:29,313 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 148873922, now seen corresponding path program 3 times [2021-07-10 10:40:29,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:29,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222106996] [2021-07-10 10:40:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 218 proven. 1 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2021-07-10 10:40:29,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:29,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222106996] [2021-07-10 10:40:29,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222106996] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:29,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788251326] [2021-07-10 10:40:29,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:29,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-10 10:40:29,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:40:29,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-10 10:40:29,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 218 proven. 1 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2021-07-10 10:40:29,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788251326] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:29,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:40:29,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-10 10:40:29,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911424581] [2021-07-10 10:40:29,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-10 10:40:29,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-10 10:40:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-10 10:40:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,916 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:29,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:29,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:29,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:29,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:29,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-07-10 10:40:30,235 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1773076992, now seen corresponding path program 1 times [2021-07-10 10:40:30,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:30,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027273560] [2021-07-10 10:40:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-10 10:40:30,287 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:30,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027273560] [2021-07-10 10:40:30,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027273560] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:30,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830066680] [2021-07-10 10:40:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:30,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-10 10:40:30,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-10 10:40:30,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830066680] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:30,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:40:30,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-07-10 10:40:30,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125572008] [2021-07-10 10:40:30,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-10 10:40:30,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-10 10:40:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-10 10:40:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,450 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:30,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:40:30,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:30,709 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024061, now seen corresponding path program 2 times [2021-07-10 10:40:30,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:30,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806289144] [2021-07-10 10:40:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-10 10:40:30,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:30,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806289144] [2021-07-10 10:40:30,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806289144] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:30,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928650194] [2021-07-10 10:40:30,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:30,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-10 10:40:30,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:40:30,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-10 10:40:30,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-10 10:40:30,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928650194] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:30,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:40:30,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-10 10:40:30,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830932721] [2021-07-10 10:40:30,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-10 10:40:30,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-10 10:40:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-10 10:40:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,992 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:30,993 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 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) [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:40:30,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:40:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:40:31,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:31,297 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:40:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:40:31,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1042813920, now seen corresponding path program 3 times [2021-07-10 10:40:31,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:40:31,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488661912] [2021-07-10 10:40:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:40:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:40:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-10 10:40:31,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:40:31,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488661912] [2021-07-10 10:40:31,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488661912] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:31,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310599291] [2021-07-10 10:40:31,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:40:31,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-10 10:40:31,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:40:31,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2021-07-10 10:40:31,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:40:31,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-10 10:40:31,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,460 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,460 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-10 10:40:31,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-10 10:40:31,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-10 10:40:31,554 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-10 10:40:31,554 INFO L388 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 [2021-07-10 10:40:31,556 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-10 10:40:31,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-10 10:40:31,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-10 10:40:31,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,595 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,602 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-10 10:40:31,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-10 10:40:31,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:31,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:31,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-10 10:40:31,694 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-07-10 10:40:32,348 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-07-10 10:40:32,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-07-10 10:40:32,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-10 10:40:32,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:32,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:32,463 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:40:32,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:32,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-10 10:40:32,476 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-07-10 10:40:33,076 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-07-10 10:40:33,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-07-10 10:40:33,099 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:33,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:33,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-10 10:40:33,104 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-07-10 10:40:33,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:40:34,385 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:40:35,000 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:40:35,494 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-07-10 10:40:36,035 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-07-10 10:40:36,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-07-10 10:40:36,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:40:36,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:40:36,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-07-10 10:40:36,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-10 10:40:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 8 not checked. [2021-07-10 10:40:36,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310599291] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:40:36,382 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:40:36,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2021-07-10 10:40:36,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414566129] [2021-07-10 10:40:36,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-07-10 10:40:36,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:40:36,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-07-10 10:40:36,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=364, Unknown=7, NotChecked=210, Total=650 [2021-07-10 10:40:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:36,384 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:40:36,384 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:40:36,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:40:40,977 WARN L205 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-07-10 10:41:03,326 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-10 10:41:15,742 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:33,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-07-10 10:41:33,917 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:41:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:41:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2133900597, now seen corresponding path program 1 times [2021-07-10 10:41:33,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:41:33,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543875297] [2021-07-10 10:41:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:41:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:41:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-07-10 10:41:34,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:41:34,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543875297] [2021-07-10 10:41:34,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543875297] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:34,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161271860] [2021-07-10 10:41:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:41:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:41:34,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjunts are in the unsatisfiable core [2021-07-10 10:41:34,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:41:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-07-10 10:41:34,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161271860] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:34,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:41:34,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-07-10 10:41:34,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548815730] [2021-07-10 10:41:34,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-10 10:41:34,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:41:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-10 10:41:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-07-10 10:41:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,290 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:41:34,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:34,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:41:34,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:41:34,633 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:41:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:41:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 471844216, now seen corresponding path program 2 times [2021-07-10 10:41:34,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:41:34,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172241713] [2021-07-10 10:41:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:41:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:41:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-07-10 10:41:34,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:41:34,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172241713] [2021-07-10 10:41:34,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172241713] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:34,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041882483] [2021-07-10 10:41:34,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:41:34,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-10 10:41:34,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:41:34,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-10 10:41:34,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:41:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-07-10 10:41:34,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041882483] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:34,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:41:34,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-10 10:41:34,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500075213] [2021-07-10 10:41:34,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-10 10:41:34,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:41:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-10 10:41:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-10 10:41:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,988 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:41:34,988 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:34,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:34,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:41:34,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:41:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:41:35,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:41:35,369 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:41:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:41:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1437232917, now seen corresponding path program 3 times [2021-07-10 10:41:35,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:41:35,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472620261] [2021-07-10 10:41:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:41:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:41:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-07-10 10:41:35,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:41:35,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472620261] [2021-07-10 10:41:35,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472620261] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:35,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683626329] [2021-07-10 10:41:35,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:41:35,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-07-10 10:41:35,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:41:35,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2021-07-10 10:41:35,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:41:35,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-10 10:41:35,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,599 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-10 10:41:35,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-10 10:41:35,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,617 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-10 10:41:35,705 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-10 10:41:35,706 INFO L388 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 [2021-07-10 10:41:35,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,710 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-10 10:41:35,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-10 10:41:35,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-10 10:41:35,744 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,748 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,754 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-10 10:41:35,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-10 10:41:35,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:35,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:35,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-10 10:41:35,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-07-10 10:41:36,479 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-07-10 10:41:36,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-07-10 10:41:36,532 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:36,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:36,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-10 10:41:36,554 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-07-10 10:41:36,899 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:41:37,562 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:41:38,205 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:41:39,964 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:41:42,630 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:41:42,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-07-10 10:41:42,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:42,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:42,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-10 10:41:42,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:45 [2021-07-10 10:41:46,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:41:46,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-07-10 10:41:46,641 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:46,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:46,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-07-10 10:41:46,657 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:42 [2021-07-10 10:41:48,320 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post40_11| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post40_11| (- 1))) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:41:49,082 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |c_t_funThread1of1ForFork0_#t~post43|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:41:49,683 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:41:50,186 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) |aux_div_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)))) is different from true [2021-07-10 10:41:50,737 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) |aux_div_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102))) is different from true [2021-07-10 10:41:50,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-07-10 10:41:50,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:41:50,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:41:50,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-07-10 10:41:50,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-10 10:41:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 13 refuted. 9 times theorem prover too weak. 112 trivial. 28 not checked. [2021-07-10 10:41:51,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683626329] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:41:51,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:41:51,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 38 [2021-07-10 10:41:51,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687516707] [2021-07-10 10:41:51,088 INFO L462 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-07-10 10:41:51,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:41:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-07-10 10:41:51,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=757, Unknown=18, NotChecked=504, Total=1406 [2021-07-10 10:41:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:51,089 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:41:51,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 5.657894736842105) internal successors, (215), 38 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:41:51,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:43:52,361 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-10 10:48:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:48:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:48:09,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-07-10 10:48:09,624 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:48:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:48:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1019339336, now seen corresponding path program 4 times [2021-07-10 10:48:09,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:48:09,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904572712] [2021-07-10 10:48:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:48:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:48:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-07-10 10:48:09,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:48:09,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904572712] [2021-07-10 10:48:09,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904572712] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:48:09,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27091765] [2021-07-10 10:48:09,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:48:09,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-10 10:48:09,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:48:09,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2021-07-10 10:48:09,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:48:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-07-10 10:48:10,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27091765] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:48:10,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:48:10,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-07-10 10:48:10,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701849945] [2021-07-10 10:48:10,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-07-10 10:48:10,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:48:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-07-10 10:48:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-07-10 10:48:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:10,086 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:48:10,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:48:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:48:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:48:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-07-10 10:48:10,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:48:10,558 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:48:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:48:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1001761691, now seen corresponding path program 5 times [2021-07-10 10:48:10,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:48:10,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022845510] [2021-07-10 10:48:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:48:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:48:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-07-10 10:48:10,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:48:10,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022845510] [2021-07-10 10:48:10,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022845510] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:48:10,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359510207] [2021-07-10 10:48:10,761 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:48:11,407 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-07-10 10:48:11,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:48:11,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-10 10:48:11,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:48:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-07-10 10:48:11,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359510207] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:48:11,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:48:11,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-10 10:48:11,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875996428] [2021-07-10 10:48:11,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-10 10:48:11,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:48:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-10 10:48:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-10 10:48:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:11,616 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:48:11,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:48:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:48:11,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:48:11,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-07-10 10:48:11,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:48:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:48:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-07-10 10:48:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-10 10:48:12,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-07-10 10:48:12,119 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-10 10:48:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-10 10:48:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1807068264, now seen corresponding path program 6 times [2021-07-10 10:48:12,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-10 10:48:12,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419898793] [2021-07-10 10:48:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-10 10:48:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-10 10:48:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-10 10:48:14,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-10 10:48:14,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419898793] [2021-07-10 10:48:14,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419898793] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:48:14,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380700737] [2021-07-10 10:48:14,926 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:48:15,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-07-10 10:48:15,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-10 10:48:15,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 46 conjunts are in the unsatisfiable core [2021-07-10 10:48:15,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-10 10:48:15,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-10 10:48:15,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,333 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,333 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-10 10:48:15,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-07-10 10:48:15,347 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,351 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-10 10:48:15,452 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-10 10:48:15,452 INFO L388 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 [2021-07-10 10:48:15,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,473 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-10 10:48:15,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-07-10 10:48:15,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-10 10:48:15,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,499 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,505 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-10 10:48:15,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-10 10:48:15,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:15,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:15,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-10 10:48:15,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-07-10 10:48:19,470 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-07-10 10:48:19,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-07-10 10:48:19,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:19,562 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:19,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-10 10:48:19,564 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-07-10 10:48:38,412 WARN L205 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-07-10 10:48:39,232 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:48:39,968 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:48:44,330 WARN L205 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:48:52,745 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:48:52,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-07-10 10:48:52,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:48:52,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:48:52,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-10 10:48:52,923 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:45 [2021-07-10 10:49:04,867 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 35 [2021-07-10 10:49:04,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:49:04,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-07-10 10:49:04,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:49:04,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:49:04,999 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-07-10 10:49:04,999 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:42 [2021-07-10 10:50:04,927 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:50:05,797 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |c_t_funThread1of1ForFork0_#t~post43|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:50:06,607 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:50:14,754 WARN L205 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:50:29,451 WARN L205 SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-10 10:50:29,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-07-10 10:50:29,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:50:29,606 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:50:29,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-07-10 10:50:29,611 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:45 [2021-07-10 10:50:45,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-10 10:50:45,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-07-10 10:50:45,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:50:45,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:50:45,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-07-10 10:50:45,299 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:42 [2021-07-10 10:50:47,322 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post40_13| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (= (store (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post40_13| (- 1))) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-10 10:50:48,211 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) |c_t_funThread1of1ForFork0_#t~post43|))) is different from true [2021-07-10 10:50:49,088 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 3) c_t_funThread1of1ForFork0_~i~0) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-10 10:50:49,710 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 3) |aux_div_~#cache~0.offset_103|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)))) is different from true [2021-07-10 10:50:50,402 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 3) |aux_div_~#cache~0.offset_103|) (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102))) is different from true [2021-07-10 10:50:50,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-07-10 10:50:50,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-10 10:50:50,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-10 10:50:50,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-07-10 10:50:50,600 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-10 10:50:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 26 refuted. 48 times theorem prover too weak. 235 trivial. 52 not checked. [2021-07-10 10:50:50,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380700737] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-10 10:50:50,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-10 10:50:50,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 52 [2021-07-10 10:50:50,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21541176] [2021-07-10 10:50:50,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-07-10 10:50:50,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-10 10:50:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-07-10 10:50:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1400, Unknown=122, NotChecked=810, Total=2652 [2021-07-10 10:50:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:50:50,722 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-10 10:50:50,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 5.25) internal successors, (273), 52 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2021-07-10 10:50:50,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-10 10:51:51,842 WARN L205 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-07-10 10:52:29,140 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 56 [2021-07-10 10:52:47,265 WARN L205 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 46 [2021-07-10 10:53:46,513 WARN L205 SmtUtils]: Spent 11.40 s on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-07-10 10:54:03,343 WARN L205 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2021-07-10 10:54:31,401 WARN L205 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2021-07-10 10:54:49,931 WARN L205 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2021-07-10 10:55:00,074 WARN L205 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 44 DAG size of output: 34 Received shutdown request... [2021-07-10 10:55:06,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-10 10:55:06,132 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-10 10:55:06,148 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2021-07-10 10:55:06,150 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-07-10 10:55:06,154 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-10 10:55:06,154 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-10 10:55:06,154 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-10 10:55:06,154 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-10 10:55:06,154 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-10 10:55:06,154 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-10 10:55:06,154 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-10 10:55:06,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-10 10:55:06,157 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-10 10:55:06,157 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/2) [2021-07-10 10:55:06,157 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-10 10:55:06,159 WARN L196 ceAbstractionStarter]: Timeout [2021-07-10 10:55:06,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 10:55:06 BasicIcfg [2021-07-10 10:55:06,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-10 10:55:06,159 INFO L168 Benchmark]: Toolchain (without parser) took 881967.65 ms. Allocated memory was 195.0 MB in the beginning and 341.8 MB in the end (delta: 146.8 MB). Free memory was 157.4 MB in the beginning and 211.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 93.6 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 195.0 MB. Free memory is still 175.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.93 ms. Allocated memory is still 195.0 MB. Free memory was 157.2 MB in the beginning and 160.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 195.0 MB. Free memory was 160.8 MB in the beginning and 157.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 ms. Allocated memory is still 195.0 MB. Free memory was 157.6 MB in the beginning and 155.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: RCFGBuilder took 481.40 ms. Allocated memory is still 195.0 MB. Free memory was 155.5 MB in the beginning and 112.0 MB in the end (delta: 43.5 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,159 INFO L168 Benchmark]: TraceAbstraction took 880898.10 ms. Allocated memory was 195.0 MB in the beginning and 341.8 MB in the end (delta: 146.8 MB). Free memory was 111.5 MB in the beginning and 211.5 MB in the end (delta: -100.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 8.0 GB. [2021-07-10 10:55:06,160 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.13 ms. Allocated memory is still 195.0 MB. Free memory is still 175.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 508.93 ms. Allocated memory is still 195.0 MB. Free memory was 157.2 MB in the beginning and 160.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 195.0 MB. Free memory was 160.8 MB in the beginning and 157.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.06 ms. Allocated memory is still 195.0 MB. Free memory was 157.6 MB in the beginning and 155.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 481.40 ms. Allocated memory is still 195.0 MB. Free memory was 155.5 MB in the beginning and 112.0 MB in the end (delta: 43.5 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 880898.10 ms. Allocated memory was 195.0 MB in the beginning and 341.8 MB in the end (delta: 146.8 MB). Free memory was 111.5 MB in the beginning and 211.5 MB in the end (delta: -100.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 70339, positive: 68019, positive conditional: 5176, positive unconditional: 62843, negative: 2320, negative conditional: 2031, negative unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 68362, positive: 68019, positive conditional: 5176, positive unconditional: 62843, negative: 343, negative conditional: 54, negative unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 68362, positive: 68015, positive conditional: 0, positive unconditional: 68015, negative: 347, negative conditional: 0, negative unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13029, positive: 12910, positive conditional: 0, positive unconditional: 12910, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13029, positive: 12854, positive conditional: 0, positive unconditional: 12854, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68362, positive: 55105, positive conditional: 0, positive unconditional: 55105, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 13029, unknown conditional: 0, unknown unconditional: 13029] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151 ], Maximal queried relation: 9, Independence queries for same thread: 1977 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 526, Number of persistent set computation: 776, Number of trivial persistent sets: 379, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 70339, positive: 68019, positive conditional: 5176, positive unconditional: 62843, negative: 2320, negative conditional: 2031, negative unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 68362, positive: 68019, positive conditional: 5176, positive unconditional: 62843, negative: 343, negative conditional: 54, negative unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 68362, positive: 68015, positive conditional: 0, positive unconditional: 68015, negative: 347, negative conditional: 0, negative unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13029, positive: 12910, positive conditional: 0, positive unconditional: 12910, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13029, positive: 12854, positive conditional: 0, positive unconditional: 12854, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68362, positive: 55105, positive conditional: 0, positive unconditional: 55105, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 13029, unknown conditional: 0, unknown unconditional: 13029] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151, SemanticConditionEliminator.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 847, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 843, negative conditional: 11, negative unconditional: 832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 58, positive conditional: 2, positive unconditional: 56, negative: 124, negative conditional: 5, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, positive: 131, positive conditional: 4, positive unconditional: 127, negative: 211, negative conditional: 12, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 847, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 838, negative conditional: 6, negative unconditional: 832, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13036, Positive cache size: 12912, Positive conditional cache size: 2, Positive unconditional cache size: 12910, Negative cache size: 124, Negative conditional cache size: 5, Negative unconditional cache size: 119, Eliminated conditions: 151 ], Maximal queried relation: 9, Independence queries for same thread: 1977 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 ], Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 0, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 ], Maximal queried relation: -1, Independence queries for same thread: 0 - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing SleepSetNewStateReduction. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing SleepSetNewStateReduction. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 880813.3ms, OverallIterations: 15, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.2ms, PartialOrderReductionTime: 692715.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 388.9ms SsaConstructionTime, 1666.7ms SatisfiabilityAnalysisTime, 182399.0ms InterpolantComputationTime, 6692 NumberOfCodeBlocks, 6394 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6664 ConstructedInterpolants, 206 QuantifiedInterpolants, 48884 SizeOfPredicates, 162 NumberOfNonLiveVariables, 5132 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 13504/14966 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 6.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.1ms, PartialOrderReductionTime: 0.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown