/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:09:21,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:09:21,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:09:21,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:09:21,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:09:21,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:09:21,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:09:21,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:09:21,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:09:21,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:09:21,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:09:21,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:09:21,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:09:21,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:09:21,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:09:21,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:09:21,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:09:21,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:09:21,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:09:21,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:09:21,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:09:21,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:09:21,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:09:21,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:09:21,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:09:21,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:09:21,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:09:21,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:09:21,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:09:21,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:09:21,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:09:21,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:09:21,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:09:21,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:09:21,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:09:21,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:09:21,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:09:21,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:09:21,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:09:21,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:09:21,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:09:21,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 10:09:21,274 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:09:21,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:09:21,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:09:21,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:09:21,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:09:21,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:09:21,278 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:09:21,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:09:21,278 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:09:21,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:09:21,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:09:21,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:09:21,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:09:21,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:09:21,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:09:21,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:09:21,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:09:21,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:09:21,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:09:21,282 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:09:21,282 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-06-05 10:09:21,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:09:21,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:09:21,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:09:21,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:09:21,618 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:09:21,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2021-06-05 10:09:21,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ec33dcb/b265618066fb420a9792d83fef1e4370/FLAG7775f3280 [2021-06-05 10:09:22,165 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:09:22,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2021-06-05 10:09:22,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ec33dcb/b265618066fb420a9792d83fef1e4370/FLAG7775f3280 [2021-06-05 10:09:22,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ec33dcb/b265618066fb420a9792d83fef1e4370 [2021-06-05 10:09:22,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:09:22,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:09:22,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:09:22,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:09:22,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:09:22,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:09:22" (1/1) ... [2021-06-05 10:09:22,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbdcba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:22, skipping insertion in model container [2021-06-05 10:09:22,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:09:22" (1/1) ... [2021-06-05 10:09:22,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:09:22,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:09:22,902 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i[951,964] [2021-06-05 10:09:23,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:09:23,058 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:09:23,067 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i[951,964] [2021-06-05 10:09:23,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:09:23,188 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:09:23,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23 WrapperNode [2021-06-05 10:09:23,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:09:23,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:09:23,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:09:23,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:09:23,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:09:23,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:09:23,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:09:23,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:09:23,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (1/1) ... [2021-06-05 10:09:23,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:09:23,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:09:23,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:09:23,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:09:23,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (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-06-05 10:09:23,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:09:23,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:09:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:09:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:09:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 10:09:23,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 10:09:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 10:09:23,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 10:09:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 10:09:23,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 10:09:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:09:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:09:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:09:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:09:23,337 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:09:24,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:09:24,960 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 10:09:24,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:09:24 BoogieIcfgContainer [2021-06-05 10:09:24,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:09:24,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:09:24,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:09:24,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:09:24,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:09:22" (1/3) ... [2021-06-05 10:09:24,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4a199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:09:24, skipping insertion in model container [2021-06-05 10:09:24,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:23" (2/3) ... [2021-06-05 10:09:24,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4a199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:09:24, skipping insertion in model container [2021-06-05 10:09:24,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:09:24" (3/3) ... [2021-06-05 10:09:24,972 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_power.opt.i [2021-06-05 10:09:24,980 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:09:24,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:09:24,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 10:09:24,981 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,040 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,040 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:25,043 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:09:25,063 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 10:09:25,087 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:09:25,087 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:09:25,087 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:09:25,087 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:09:25,087 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:09:25,087 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:09:25,087 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:09:25,088 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:09:25,100 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 107 transitions, 229 flow [2021-06-05 10:09:26,111 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16152 states, 16148 states have (on average 3.635496655932623) internal successors, (58706), 16151 states have internal predecessors, (58706), 0 states have call successors, (0), 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-06-05 10:09:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 16152 states, 16148 states have (on average 3.635496655932623) internal successors, (58706), 16151 states have internal predecessors, (58706), 0 states have call successors, (0), 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-06-05 10:09:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-06-05 10:09:26,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:26,165 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:26,165 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:26,170 INFO L82 PathProgramCache]: Analyzing trace with hash -205127991, now seen corresponding path program 1 times [2021-06-05 10:09:26,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:26,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51991040] [2021-06-05 10:09:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:26,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:26,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51991040] [2021-06-05 10:09:26,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51991040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:26,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:26,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:09:26,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003358902] [2021-06-05 10:09:26,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:09:26,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:09:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:09:26,541 INFO L87 Difference]: Start difference. First operand has 16152 states, 16148 states have (on average 3.635496655932623) internal successors, (58706), 16151 states have internal predecessors, (58706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:26,857 INFO L93 Difference]: Finished difference Result 13856 states and 49121 transitions. [2021-06-05 10:09:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:09:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-06-05 10:09:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:26,942 INFO L225 Difference]: With dead ends: 13856 [2021-06-05 10:09:26,943 INFO L226 Difference]: Without dead ends: 8224 [2021-06-05 10:09:26,944 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:09:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8224 states. [2021-06-05 10:09:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8224 to 8224. [2021-06-05 10:09:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8224 states, 8223 states have (on average 3.490818436093883) internal successors, (28705), 8223 states have internal predecessors, (28705), 0 states have call successors, (0), 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-06-05 10:09:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8224 states to 8224 states and 28705 transitions. [2021-06-05 10:09:27,601 INFO L78 Accepts]: Start accepts. Automaton has 8224 states and 28705 transitions. Word has length 49 [2021-06-05 10:09:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:27,601 INFO L482 AbstractCegarLoop]: Abstraction has 8224 states and 28705 transitions. [2021-06-05 10:09:27,602 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8224 states and 28705 transitions. [2021-06-05 10:09:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 10:09:27,626 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:27,626 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:27,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:09:27,626 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1262180099, now seen corresponding path program 1 times [2021-06-05 10:09:27,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:27,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566849493] [2021-06-05 10:09:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:27,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:27,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566849493] [2021-06-05 10:09:27,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566849493] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:27,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:27,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:09:27,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961210969] [2021-06-05 10:09:27,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:09:27,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:09:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:09:27,881 INFO L87 Difference]: Start difference. First operand 8224 states and 28705 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-06-05 10:09:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:28,144 INFO L93 Difference]: Finished difference Result 9504 states and 32865 transitions. [2021-06-05 10:09:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:09:28,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 10:09:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:28,198 INFO L225 Difference]: With dead ends: 9504 [2021-06-05 10:09:28,198 INFO L226 Difference]: Without dead ends: 7456 [2021-06-05 10:09:28,199 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:09:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2021-06-05 10:09:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2021-06-05 10:09:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 3.46411804158283) internal successors, (25825), 7455 states have internal predecessors, (25825), 0 states have call successors, (0), 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-06-05 10:09:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 25825 transitions. [2021-06-05 10:09:28,505 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 25825 transitions. Word has length 68 [2021-06-05 10:09:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:28,506 INFO L482 AbstractCegarLoop]: Abstraction has 7456 states and 25825 transitions. [2021-06-05 10:09:28,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-06-05 10:09:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 25825 transitions. [2021-06-05 10:09:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 10:09:28,521 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:28,522 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:28,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:09:28,522 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1122307868, now seen corresponding path program 1 times [2021-06-05 10:09:28,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:28,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312108820] [2021-06-05 10:09:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:28,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:28,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312108820] [2021-06-05 10:09:28,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312108820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:28,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:28,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:09:28,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854661702] [2021-06-05 10:09:28,761 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:09:28,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:09:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:09:28,763 INFO L87 Difference]: Start difference. First operand 7456 states and 25825 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-06-05 10:09:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:29,060 INFO L93 Difference]: Finished difference Result 10288 states and 35463 transitions. [2021-06-05 10:09:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:09:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 10:09:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:29,082 INFO L225 Difference]: With dead ends: 10288 [2021-06-05 10:09:29,082 INFO L226 Difference]: Without dead ends: 5296 [2021-06-05 10:09:29,083 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 124.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:09:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2021-06-05 10:09:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5296. [2021-06-05 10:09:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 5295 states have (on average 3.350897072710104) internal successors, (17743), 5295 states have internal predecessors, (17743), 0 states have call successors, (0), 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-06-05 10:09:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 17743 transitions. [2021-06-05 10:09:29,304 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 17743 transitions. Word has length 70 [2021-06-05 10:09:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:29,304 INFO L482 AbstractCegarLoop]: Abstraction has 5296 states and 17743 transitions. [2021-06-05 10:09:29,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-06-05 10:09:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 17743 transitions. [2021-06-05 10:09:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:09:29,314 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:29,314 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:29,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:09:29,315 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 697133054, now seen corresponding path program 1 times [2021-06-05 10:09:29,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:29,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759221145] [2021-06-05 10:09:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:29,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:29,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759221145] [2021-06-05 10:09:29,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759221145] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:29,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:29,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:09:29,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855600119] [2021-06-05 10:09:29,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:09:29,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:09:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:09:29,608 INFO L87 Difference]: Start difference. First operand 5296 states and 17743 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:29,831 INFO L93 Difference]: Finished difference Result 6220 states and 20733 transitions. [2021-06-05 10:09:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 10:09:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:09:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:29,853 INFO L225 Difference]: With dead ends: 6220 [2021-06-05 10:09:29,853 INFO L226 Difference]: Without dead ends: 5260 [2021-06-05 10:09:29,854 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:09:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2021-06-05 10:09:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2021-06-05 10:09:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 3.346453698421753) internal successors, (17599), 5259 states have internal predecessors, (17599), 0 states have call successors, (0), 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-06-05 10:09:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 17599 transitions. [2021-06-05 10:09:30,054 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 17599 transitions. Word has length 73 [2021-06-05 10:09:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:30,055 INFO L482 AbstractCegarLoop]: Abstraction has 5260 states and 17599 transitions. [2021-06-05 10:09:30,055 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 17599 transitions. [2021-06-05 10:09:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 10:09:30,065 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:30,065 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:30,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:09:30,065 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1229713121, now seen corresponding path program 1 times [2021-06-05 10:09:30,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:30,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244159505] [2021-06-05 10:09:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:30,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:30,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244159505] [2021-06-05 10:09:30,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244159505] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:30,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:30,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:09:30,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91782796] [2021-06-05 10:09:30,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:09:30,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:09:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:09:30,205 INFO L87 Difference]: Start difference. First operand 5260 states and 17599 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 10:09:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:30,320 INFO L93 Difference]: Finished difference Result 6108 states and 20097 transitions. [2021-06-05 10:09:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:09:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 10:09:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:30,335 INFO L225 Difference]: With dead ends: 6108 [2021-06-05 10:09:30,335 INFO L226 Difference]: Without dead ends: 4636 [2021-06-05 10:09:30,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:09:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2021-06-05 10:09:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 4636. [2021-06-05 10:09:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4635 states have (on average 3.2778856526429343) internal successors, (15193), 4635 states have internal predecessors, (15193), 0 states have call successors, (0), 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-06-05 10:09:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 15193 transitions. [2021-06-05 10:09:30,459 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 15193 transitions. Word has length 74 [2021-06-05 10:09:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:30,459 INFO L482 AbstractCegarLoop]: Abstraction has 4636 states and 15193 transitions. [2021-06-05 10:09:30,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 10:09:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 15193 transitions. [2021-06-05 10:09:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 10:09:30,535 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:30,535 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:30,535 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:09:30,535 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1194087137, now seen corresponding path program 1 times [2021-06-05 10:09:30,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:30,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902577424] [2021-06-05 10:09:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:30,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:30,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902577424] [2021-06-05 10:09:30,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902577424] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:30,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:30,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:09:30,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194568083] [2021-06-05 10:09:30,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:09:30,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:09:30,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:09:30,649 INFO L87 Difference]: Start difference. First operand 4636 states and 15193 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-06-05 10:09:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:30,785 INFO L93 Difference]: Finished difference Result 4312 states and 13672 transitions. [2021-06-05 10:09:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:09:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 10:09:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:30,795 INFO L225 Difference]: With dead ends: 4312 [2021-06-05 10:09:30,795 INFO L226 Difference]: Without dead ends: 3160 [2021-06-05 10:09:30,796 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:09:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2021-06-05 10:09:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3160. [2021-06-05 10:09:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 3159 states have (on average 3.113327002215891) internal successors, (9835), 3159 states have internal predecessors, (9835), 0 states have call successors, (0), 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-06-05 10:09:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 9835 transitions. [2021-06-05 10:09:30,877 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 9835 transitions. Word has length 75 [2021-06-05 10:09:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:30,877 INFO L482 AbstractCegarLoop]: Abstraction has 3160 states and 9835 transitions. [2021-06-05 10:09:30,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-06-05 10:09:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 9835 transitions. [2021-06-05 10:09:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 10:09:30,884 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:30,884 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:30,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:09:30,885 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1923569891, now seen corresponding path program 1 times [2021-06-05 10:09:30,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:30,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128047159] [2021-06-05 10:09:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:31,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:31,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128047159] [2021-06-05 10:09:31,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128047159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:31,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:31,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 10:09:31,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723652968] [2021-06-05 10:09:31,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 10:09:31,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 10:09:31,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:09:31,032 INFO L87 Difference]: Start difference. First operand 3160 states and 9835 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-06-05 10:09:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:31,178 INFO L93 Difference]: Finished difference Result 2512 states and 7612 transitions. [2021-06-05 10:09:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:09:31,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 10:09:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:31,184 INFO L225 Difference]: With dead ends: 2512 [2021-06-05 10:09:31,184 INFO L226 Difference]: Without dead ends: 1972 [2021-06-05 10:09:31,185 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 114.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:09:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2021-06-05 10:09:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1972. [2021-06-05 10:09:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 2.980720446473871) internal successors, (5875), 1971 states have internal predecessors, (5875), 0 states have call successors, (0), 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-06-05 10:09:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 5875 transitions. [2021-06-05 10:09:31,228 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 5875 transitions. Word has length 78 [2021-06-05 10:09:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:31,229 INFO L482 AbstractCegarLoop]: Abstraction has 1972 states and 5875 transitions. [2021-06-05 10:09:31,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-06-05 10:09:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 5875 transitions. [2021-06-05 10:09:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:09:31,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:31,235 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:31,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:09:31,236 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash -812219985, now seen corresponding path program 1 times [2021-06-05 10:09:31,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:31,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933989407] [2021-06-05 10:09:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:31,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:31,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933989407] [2021-06-05 10:09:31,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933989407] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:31,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:31,423 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:09:31,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068604306] [2021-06-05 10:09:31,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:09:31,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:09:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:09:31,424 INFO L87 Difference]: Start difference. First operand 1972 states and 5875 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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-06-05 10:09:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:31,503 INFO L93 Difference]: Finished difference Result 2692 states and 8080 transitions. [2021-06-05 10:09:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 10:09:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:09:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:31,507 INFO L225 Difference]: With dead ends: 2692 [2021-06-05 10:09:31,507 INFO L226 Difference]: Without dead ends: 1216 [2021-06-05 10:09:31,507 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:09:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2021-06-05 10:09:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2021-06-05 10:09:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 2.9193415637860083) internal successors, (3547), 1215 states have internal predecessors, (3547), 0 states have call successors, (0), 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-06-05 10:09:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3547 transitions. [2021-06-05 10:09:31,529 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3547 transitions. Word has length 83 [2021-06-05 10:09:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:31,529 INFO L482 AbstractCegarLoop]: Abstraction has 1216 states and 3547 transitions. [2021-06-05 10:09:31,529 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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-06-05 10:09:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3547 transitions. [2021-06-05 10:09:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:09:31,532 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:31,533 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:31,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:09:31,533 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 98437423, now seen corresponding path program 2 times [2021-06-05 10:09:31,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:31,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499995417] [2021-06-05 10:09:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:31,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:31,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499995417] [2021-06-05 10:09:31,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499995417] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:31,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:31,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 10:09:31,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125412257] [2021-06-05 10:09:31,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 10:09:31,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 10:09:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:09:31,846 INFO L87 Difference]: Start difference. First operand 1216 states and 3547 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-06-05 10:09:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:32,099 INFO L93 Difference]: Finished difference Result 1786 states and 5262 transitions. [2021-06-05 10:09:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:09:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:09:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:32,104 INFO L225 Difference]: With dead ends: 1786 [2021-06-05 10:09:32,104 INFO L226 Difference]: Without dead ends: 908 [2021-06-05 10:09:32,105 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 307.5ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:09:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-06-05 10:09:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2021-06-05 10:09:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 2.816979051819184) internal successors, (2555), 907 states have internal predecessors, (2555), 0 states have call successors, (0), 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-06-05 10:09:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2555 transitions. [2021-06-05 10:09:32,118 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 2555 transitions. Word has length 83 [2021-06-05 10:09:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:32,119 INFO L482 AbstractCegarLoop]: Abstraction has 908 states and 2555 transitions. [2021-06-05 10:09:32,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-06-05 10:09:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2555 transitions. [2021-06-05 10:09:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:09:32,121 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:32,121 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:09:32,121 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:09:32,121 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash 441823535, now seen corresponding path program 3 times [2021-06-05 10:09:32,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:32,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887083807] [2021-06-05 10:09:32,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:09:32,163 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:09:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:09:32,213 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:09:32,267 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:09:32,268 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:09:32,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:09:32,270 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:09:32,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:09:32 BasicIcfg [2021-06-05 10:09:32,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:09:32,411 INFO L168 Benchmark]: Toolchain (without parser) took 9713.80 ms. Allocated memory was 369.1 MB in the beginning and 3.4 GB in the end (delta: 3.0 GB). Free memory was 330.6 MB in the beginning and 2.8 GB in the end (delta: -2.5 GB). Peak memory consumption was 474.8 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,412 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 369.1 MB. Free memory was 348.9 MB in the beginning and 348.9 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:09:32,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.16 ms. Allocated memory is still 369.1 MB. Free memory was 330.4 MB in the beginning and 326.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.85 ms. Allocated memory is still 369.1 MB. Free memory was 326.6 MB in the beginning and 323.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,413 INFO L168 Benchmark]: Boogie Preprocessor took 28.48 ms. Allocated memory is still 369.1 MB. Free memory was 323.4 MB in the beginning and 321.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,416 INFO L168 Benchmark]: RCFGBuilder took 1694.54 ms. Allocated memory is still 369.1 MB. Free memory was 321.3 MB in the beginning and 262.8 MB in the end (delta: 58.6 MB). Peak memory consumption was 146.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,416 INFO L168 Benchmark]: TraceAbstraction took 7445.44 ms. Allocated memory was 369.1 MB in the beginning and 3.4 GB in the end (delta: 3.0 GB). Free memory was 262.8 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 405.5 MB. Max. memory is 16.0 GB. [2021-06-05 10:09:32,422 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.14 ms. Allocated memory is still 369.1 MB. Free memory was 348.9 MB in the beginning and 348.9 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 476.16 ms. Allocated memory is still 369.1 MB. Free memory was 330.4 MB in the beginning and 326.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.85 ms. Allocated memory is still 369.1 MB. Free memory was 326.6 MB in the beginning and 323.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.48 ms. Allocated memory is still 369.1 MB. Free memory was 323.4 MB in the beginning and 321.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1694.54 ms. Allocated memory is still 369.1 MB. Free memory was 321.3 MB in the beginning and 262.8 MB in the end (delta: 58.6 MB). Peak memory consumption was 146.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7445.44 ms. Allocated memory was 369.1 MB in the beginning and 3.4 GB in the end (delta: 3.0 GB). Free memory was 262.8 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 405.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2284; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7183.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 203.4ms, AutomataDifference: 2110.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1023.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1144 SDtfs, 1798 SDslu, 3806 SDs, 0 SdLazy, 394 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 463.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1042.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16152occurred in iteration=0, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1656.0ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.2ms SsaConstructionTime, 513.1ms SatisfiabilityAnalysisTime, 1349.9ms InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 644 ConstructedInterpolants, 0 QuantifiedInterpolants, 2834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...