/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:05:04,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:05:04,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:05:04,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:05:04,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:05:04,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:05:04,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:05:04,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:05:04,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:05:04,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:05:04,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:05:04,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:05:04,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:05:04,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:05:04,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:05:04,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:05:04,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:05:04,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:05:04,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:05:04,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:05:04,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:05:04,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:05:04,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:05:04,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:05:04,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:05:04,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:05:04,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:05:04,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:05:04,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:05:04,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:05:04,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:05:04,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:05:04,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:05:04,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:05:04,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:05:04,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:05:04,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:05:04,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:05:04,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:05:04,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:05:04,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:05:04,269 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-SemanticLbe.epf [2021-03-11 11:05:04,293 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:05:04,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:05:04,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:05:04,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:05:04,297 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:05:04,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:05:04,297 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:05:04,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:05:04,298 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:05:04,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:05:04,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:05:04,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:05:04,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:05:04,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:05:04,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:05:04,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:05:04,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:05:04,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:05:04,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:05:04,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:05:04,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:05:04,300 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-03-11 11:05:04,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:05:04,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:05:04,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:05:04,598 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:05:04,598 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:05:04,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2021-03-11 11:05:04,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79e84052/a9e55ee3da5b472c8be35f75c3a060f5/FLAG2b0f38bf9 [2021-03-11 11:05:05,194 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:05:05,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2021-03-11 11:05:05,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79e84052/a9e55ee3da5b472c8be35f75c3a060f5/FLAG2b0f38bf9 [2021-03-11 11:05:05,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79e84052/a9e55ee3da5b472c8be35f75c3a060f5 [2021-03-11 11:05:05,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:05:05,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:05:05,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:05:05,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:05:05,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:05:05,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:05:05" (1/1) ... [2021-03-11 11:05:05,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc90c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:05, skipping insertion in model container [2021-03-11 11:05:05,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:05:05" (1/1) ... [2021-03-11 11:05:05,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:05:05,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:05:05,864 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i[950,963] [2021-03-11 11:05:06,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:05:06,117 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:05:06,129 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i[950,963] [2021-03-11 11:05:06,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:05:06,278 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:05:06,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06 WrapperNode [2021-03-11 11:05:06,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:05:06,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:05:06,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:05:06,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:05:06,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:05:06,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:05:06,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:05:06,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:05:06,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (1/1) ... [2021-03-11 11:05:06,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:05:06,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:05:06,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:05:06,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:05:06,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (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-03-11 11:05:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:05:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:05:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:05:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:05:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:05:06,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:05:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:05:06,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:05:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:05:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:05:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:05:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:05:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:05:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:05:06,502 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:05:08,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:05:08,270 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:05:08,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:05:08 BoogieIcfgContainer [2021-03-11 11:05:08,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:05:08,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:05:08,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:05:08,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:05:08,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:05:05" (1/3) ... [2021-03-11 11:05:08,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a05768b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:05:08, skipping insertion in model container [2021-03-11 11:05:08,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:05:06" (2/3) ... [2021-03-11 11:05:08,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a05768b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:05:08, skipping insertion in model container [2021-03-11 11:05:08,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:05:08" (3/3) ... [2021-03-11 11:05:08,281 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2021-03-11 11:05:08,285 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:05:08,286 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:05:08,288 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:05:08,289 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:05:08,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,320 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:05:08,343 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:05:08,357 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:05:08,372 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:05:08,373 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:05:08,373 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:05:08,373 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:05:08,373 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:05:08,373 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:05:08,373 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:05:08,373 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:05:08,383 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:05:08,391 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow [2021-03-11 11:05:08,393 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 213 flow [2021-03-11 11:05:08,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-11 11:05:08,427 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-11 11:05:08,427 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:05:08,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-11 11:05:08,432 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2021-03-11 11:05:09,733 WARN L205 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-11 11:05:10,396 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-11 11:05:11,701 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 11:05:12,268 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 11:05:14,008 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 11:05:14,403 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-03-11 11:05:14,562 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:05:15,382 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-03-11 11:05:16,426 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 11:05:16,555 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 11:05:16,827 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 11:05:16,953 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 11:05:16,964 INFO L131 LiptonReduction]: Checked pairs total: 5204 [2021-03-11 11:05:16,964 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 11:05:16,971 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2021-03-11 11:05:17,052 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1152 states, 1148 states have (on average 3.416376306620209) internal successors, (3922), 1151 states have internal predecessors, (3922), 0 states have call successors, (0), 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-03-11 11:05:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 1152 states, 1148 states have (on average 3.416376306620209) internal successors, (3922), 1151 states have internal predecessors, (3922), 0 states have call successors, (0), 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-03-11 11:05:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 11:05:17,060 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:17,061 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 11:05:17,062 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1020480132, now seen corresponding path program 1 times [2021-03-11 11:05:17,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:17,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147532517] [2021-03-11 11:05:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:17,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:17,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:17,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147532517] [2021-03-11 11:05:17,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:17,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:05:17,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616256730] [2021-03-11 11:05:17,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:05:17,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:05:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:05:17,306 INFO L87 Difference]: Start difference. First operand has 1152 states, 1148 states have (on average 3.416376306620209) internal successors, (3922), 1151 states have internal predecessors, (3922), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-03-11 11:05:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:17,387 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2021-03-11 11:05:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:05:17,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-03-11 11:05:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:17,416 INFO L225 Difference]: With dead ends: 962 [2021-03-11 11:05:17,417 INFO L226 Difference]: Without dead ends: 812 [2021-03-11 11:05:17,420 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:05:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-03-11 11:05:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2021-03-11 11:05:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 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-03-11 11:05:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2021-03-11 11:05:17,501 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2021-03-11 11:05:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:17,502 INFO L480 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2021-03-11 11:05:17,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-03-11 11:05:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2021-03-11 11:05:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:05:17,503 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:17,503 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:17,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:05:17,504 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1397629729, now seen corresponding path program 1 times [2021-03-11 11:05:17,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:17,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81921724] [2021-03-11 11:05:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:17,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:17,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:17,637 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:17,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:17,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81921724] [2021-03-11 11:05:17,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:17,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:05:17,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216450156] [2021-03-11 11:05:17,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:05:17,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:05:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:05:17,644 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-03-11 11:05:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:17,672 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2021-03-11 11:05:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:05:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-03-11 11:05:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:17,677 INFO L225 Difference]: With dead ends: 862 [2021-03-11 11:05:17,677 INFO L226 Difference]: Without dead ends: 712 [2021-03-11 11:05:17,678 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-03-11 11:05:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2021-03-11 11:05:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 3.1153305203938118) internal successors, (2215), 711 states have internal predecessors, (2215), 0 states have call successors, (0), 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-03-11 11:05:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2021-03-11 11:05:17,705 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2021-03-11 11:05:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:17,705 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2021-03-11 11:05:17,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-03-11 11:05:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2021-03-11 11:05:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:05:17,708 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:17,708 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:17,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:05:17,708 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1233871132, now seen corresponding path program 1 times [2021-03-11 11:05:17,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:17,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839557483] [2021-03-11 11:05:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:17,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:05:17,839 INFO L142 QuantifierPusher]: treesize reduction 11, result has 47.6 percent of original size [2021-03-11 11:05:17,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:05:17,843 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:17,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:17,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839557483] [2021-03-11 11:05:17,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:17,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:05:17,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311562205] [2021-03-11 11:05:17,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:05:17,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:05:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:05:17,854 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-11 11:05:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:17,930 INFO L93 Difference]: Finished difference Result 796 states and 2398 transitions. [2021-03-11 11:05:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:05:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-03-11 11:05:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:17,954 INFO L225 Difference]: With dead ends: 796 [2021-03-11 11:05:17,954 INFO L226 Difference]: Without dead ends: 696 [2021-03-11 11:05:17,954 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-03-11 11:05:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2021-03-11 11:05:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 3.1007194244604315) internal successors, (2155), 695 states have internal predecessors, (2155), 0 states have call successors, (0), 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-03-11 11:05:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2155 transitions. [2021-03-11 11:05:17,975 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2155 transitions. Word has length 12 [2021-03-11 11:05:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:17,976 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 2155 transitions. [2021-03-11 11:05:17,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-11 11:05:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2155 transitions. [2021-03-11 11:05:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:05:17,982 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:17,982 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:17,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:05:17,982 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash 404711943, now seen corresponding path program 1 times [2021-03-11 11:05:17,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:17,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045039928] [2021-03-11 11:05:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:18,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:18,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:05:18,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:05:18,147 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:18,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:18,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045039928] [2021-03-11 11:05:18,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:18,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:05:18,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990864528] [2021-03-11 11:05:18,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:05:18,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:05:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:05:18,155 INFO L87 Difference]: Start difference. First operand 696 states and 2155 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-11 11:05:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:18,262 INFO L93 Difference]: Finished difference Result 792 states and 2387 transitions. [2021-03-11 11:05:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:05:18,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-03-11 11:05:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:18,267 INFO L225 Difference]: With dead ends: 792 [2021-03-11 11:05:18,268 INFO L226 Difference]: Without dead ends: 704 [2021-03-11 11:05:18,268 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.0ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:05:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-03-11 11:05:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-03-11 11:05:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 3.0825035561877665) internal successors, (2167), 703 states have internal predecessors, (2167), 0 states have call successors, (0), 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-03-11 11:05:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2167 transitions. [2021-03-11 11:05:18,290 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2167 transitions. Word has length 13 [2021-03-11 11:05:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 2167 transitions. [2021-03-11 11:05:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-11 11:05:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2167 transitions. [2021-03-11 11:05:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:05:18,295 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:18,295 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:18,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:05:18,295 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1259748828, now seen corresponding path program 1 times [2021-03-11 11:05:18,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:18,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600206547] [2021-03-11 11:05:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:18,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:05:18,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:18,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:05:18,409 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:18,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:18,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600206547] [2021-03-11 11:05:18,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:18,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:05:18,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177293392] [2021-03-11 11:05:18,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:05:18,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:05:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:05:18,420 INFO L87 Difference]: Start difference. First operand 704 states and 2167 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-03-11 11:05:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:18,582 INFO L93 Difference]: Finished difference Result 754 states and 2276 transitions. [2021-03-11 11:05:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:05:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-03-11 11:05:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:18,587 INFO L225 Difference]: With dead ends: 754 [2021-03-11 11:05:18,588 INFO L226 Difference]: Without dead ends: 690 [2021-03-11 11:05:18,590 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:05:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-03-11 11:05:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 680. [2021-03-11 11:05:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 3.070692194403535) internal successors, (2085), 679 states have internal predecessors, (2085), 0 states have call successors, (0), 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-03-11 11:05:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 2085 transitions. [2021-03-11 11:05:18,611 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 2085 transitions. Word has length 14 [2021-03-11 11:05:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:18,612 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 2085 transitions. [2021-03-11 11:05:18,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-03-11 11:05:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 2085 transitions. [2021-03-11 11:05:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:05:18,613 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:18,613 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:18,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:05:18,613 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:18,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash -397496633, now seen corresponding path program 1 times [2021-03-11 11:05:18,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:18,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199922452] [2021-03-11 11:05:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:18,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:05:18,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:18,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:05:18,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:05:18,720 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:18,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:18,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199922452] [2021-03-11 11:05:18,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:18,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:05:18,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494402487] [2021-03-11 11:05:18,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:05:18,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:05:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:05:18,727 INFO L87 Difference]: Start difference. First operand 680 states and 2085 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:18,860 INFO L93 Difference]: Finished difference Result 842 states and 2532 transitions. [2021-03-11 11:05:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:05:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-03-11 11:05:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:18,864 INFO L225 Difference]: With dead ends: 842 [2021-03-11 11:05:18,864 INFO L226 Difference]: Without dead ends: 774 [2021-03-11 11:05:18,865 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:05:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2021-03-11 11:05:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 764. [2021-03-11 11:05:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 3.0498034076015728) internal successors, (2327), 763 states have internal predecessors, (2327), 0 states have call successors, (0), 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-03-11 11:05:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2327 transitions. [2021-03-11 11:05:18,885 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2327 transitions. Word has length 15 [2021-03-11 11:05:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 2327 transitions. [2021-03-11 11:05:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2327 transitions. [2021-03-11 11:05:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:05:18,892 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:18,892 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:18,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:05:18,893 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:18,893 INFO L82 PathProgramCache]: Analyzing trace with hash 489153408, now seen corresponding path program 1 times [2021-03-11 11:05:18,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:18,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148522132] [2021-03-11 11:05:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:18,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:05:18,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:18,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:19,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:19,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:05:19,028 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:19,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148522132] [2021-03-11 11:05:19,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:05:19,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310999691] [2021-03-11 11:05:19,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:05:19,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:05:19,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:05:19,035 INFO L87 Difference]: Start difference. First operand 764 states and 2327 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,132 INFO L93 Difference]: Finished difference Result 788 states and 2361 transitions. [2021-03-11 11:05:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:05:19,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-03-11 11:05:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,136 INFO L225 Difference]: With dead ends: 788 [2021-03-11 11:05:19,136 INFO L226 Difference]: Without dead ends: 748 [2021-03-11 11:05:19,137 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 48.6ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:05:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-03-11 11:05:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2021-03-11 11:05:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.040160642570281) internal successors, (2271), 747 states have internal predecessors, (2271), 0 states have call successors, (0), 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-03-11 11:05:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2271 transitions. [2021-03-11 11:05:19,156 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2271 transitions. Word has length 15 [2021-03-11 11:05:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,156 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 2271 transitions. [2021-03-11 11:05:19,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2271 transitions. [2021-03-11 11:05:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:05:19,158 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,158 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:19,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:05:19,158 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1914927224, now seen corresponding path program 1 times [2021-03-11 11:05:19,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907463556] [2021-03-11 11:05:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:05:19,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,231 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:19,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907463556] [2021-03-11 11:05:19,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:05:19,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596485982] [2021-03-11 11:05:19,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:05:19,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:05:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:05:19,238 INFO L87 Difference]: Start difference. First operand 748 states and 2271 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,268 INFO L93 Difference]: Finished difference Result 1101 states and 3291 transitions. [2021-03-11 11:05:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:05:19,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-03-11 11:05:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,272 INFO L225 Difference]: With dead ends: 1101 [2021-03-11 11:05:19,272 INFO L226 Difference]: Without dead ends: 754 [2021-03-11 11:05:19,273 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-03-11 11:05:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 694. [2021-03-11 11:05:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 2.878787878787879) internal successors, (1995), 693 states have internal predecessors, (1995), 0 states have call successors, (0), 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-03-11 11:05:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1995 transitions. [2021-03-11 11:05:19,291 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1995 transitions. Word has length 15 [2021-03-11 11:05:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,291 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1995 transitions. [2021-03-11 11:05:19,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1995 transitions. [2021-03-11 11:05:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:05:19,293 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,293 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:19,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:05:19,293 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1284763448, now seen corresponding path program 2 times [2021-03-11 11:05:19,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708163484] [2021-03-11 11:05:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:05:19,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:05:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708163484] [2021-03-11 11:05:19,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:05:19,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028715279] [2021-03-11 11:05:19,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:05:19,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:05:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:05:19,355 INFO L87 Difference]: Start difference. First operand 694 states and 1995 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,383 INFO L93 Difference]: Finished difference Result 642 states and 1624 transitions. [2021-03-11 11:05:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:05:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-03-11 11:05:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,385 INFO L225 Difference]: With dead ends: 642 [2021-03-11 11:05:19,386 INFO L226 Difference]: Without dead ends: 474 [2021-03-11 11:05:19,386 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-03-11 11:05:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-03-11 11:05:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.45877378435518) internal successors, (1163), 473 states have internal predecessors, (1163), 0 states have call successors, (0), 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-03-11 11:05:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1163 transitions. [2021-03-11 11:05:19,398 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1163 transitions. Word has length 15 [2021-03-11 11:05:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,398 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 1163 transitions. [2021-03-11 11:05:19,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-11 11:05:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1163 transitions. [2021-03-11 11:05:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:05:19,399 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,399 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:19,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:05:19,399 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1448378617, now seen corresponding path program 1 times [2021-03-11 11:05:19,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597393834] [2021-03-11 11:05:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:05:19,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:05:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597393834] [2021-03-11 11:05:19,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:05:19,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434603896] [2021-03-11 11:05:19,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:05:19,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:05:19,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:19,466 INFO L87 Difference]: Start difference. First operand 474 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-03-11 11:05:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,500 INFO L93 Difference]: Finished difference Result 364 states and 821 transitions. [2021-03-11 11:05:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:05:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-03-11 11:05:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,502 INFO L225 Difference]: With dead ends: 364 [2021-03-11 11:05:19,502 INFO L226 Difference]: Without dead ends: 286 [2021-03-11 11:05:19,502 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:05:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-03-11 11:05:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2021-03-11 11:05:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.227450980392157) internal successors, (568), 255 states have internal predecessors, (568), 0 states have call successors, (0), 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-03-11 11:05:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 568 transitions. [2021-03-11 11:05:19,508 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 568 transitions. Word has length 16 [2021-03-11 11:05:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 568 transitions. [2021-03-11 11:05:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-03-11 11:05:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 568 transitions. [2021-03-11 11:05:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:05:19,509 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,509 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:05:19,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:05:19,509 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1108314485, now seen corresponding path program 1 times [2021-03-11 11:05:19,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109609453] [2021-03-11 11:05:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:05:19,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:05:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109609453] [2021-03-11 11:05:19,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:05:19,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001010980] [2021-03-11 11:05:19,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:05:19,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:05:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:05:19,599 INFO L87 Difference]: Start difference. First operand 256 states and 568 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:05:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,662 INFO L93 Difference]: Finished difference Result 225 states and 505 transitions. [2021-03-11 11:05:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:05:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:05:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,663 INFO L225 Difference]: With dead ends: 225 [2021-03-11 11:05:19,663 INFO L226 Difference]: Without dead ends: 166 [2021-03-11 11:05:19,664 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:05:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-03-11 11:05:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-03-11 11:05:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.296969696969697) internal successors, (379), 165 states have internal predecessors, (379), 0 states have call successors, (0), 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-03-11 11:05:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2021-03-11 11:05:19,668 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 19 [2021-03-11 11:05:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,668 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2021-03-11 11:05:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:05:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2021-03-11 11:05:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-03-11 11:05:19,669 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,669 INFO L519 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] [2021-03-11 11:05:19,669 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:05:19,669 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash 80899176, now seen corresponding path program 1 times [2021-03-11 11:05:19,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573696126] [2021-03-11 11:05:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:05:19,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:05:19,743 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:19,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:19,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573696126] [2021-03-11 11:05:19,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:19,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:05:19,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094413563] [2021-03-11 11:05:19,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:05:19,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:05:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:05:19,750 INFO L87 Difference]: Start difference. First operand 166 states and 379 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-03-11 11:05:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:19,779 INFO L93 Difference]: Finished difference Result 205 states and 457 transitions. [2021-03-11 11:05:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:05:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-03-11 11:05:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:19,781 INFO L225 Difference]: With dead ends: 205 [2021-03-11 11:05:19,781 INFO L226 Difference]: Without dead ends: 74 [2021-03-11 11:05:19,781 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:05:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-03-11 11:05:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-03-11 11:05:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.904109589041096) internal successors, (139), 73 states have internal predecessors, (139), 0 states have call successors, (0), 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-03-11 11:05:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2021-03-11 11:05:19,783 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2021-03-11 11:05:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:19,783 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2021-03-11 11:05:19,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-03-11 11:05:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2021-03-11 11:05:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-03-11 11:05:19,784 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:19,784 INFO L519 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] [2021-03-11 11:05:19,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:05:19,784 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1941121310, now seen corresponding path program 2 times [2021-03-11 11:05:19,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:19,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230105542] [2021-03-11 11:05:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:05:19,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:05:19,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-11 11:05:19,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-11 11:05:19,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-11 11:05:19,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:05:19,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-11 11:05:20,006 INFO L142 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size [2021-03-11 11:05:20,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:05:20,026 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:05:20,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:05:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:05:20,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230105542] [2021-03-11 11:05:20,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:05:20,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:05:20,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967588814] [2021-03-11 11:05:20,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:05:20,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:05:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:05:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:05:20,035 INFO L87 Difference]: Start difference. First operand 74 states and 139 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-03-11 11:05:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:05:20,177 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2021-03-11 11:05:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:05:20,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-03-11 11:05:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:05:20,178 INFO L225 Difference]: With dead ends: 95 [2021-03-11 11:05:20,179 INFO L226 Difference]: Without dead ends: 52 [2021-03-11 11:05:20,179 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:05:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-03-11 11:05:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-03-11 11:05:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:05:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 87 transitions. [2021-03-11 11:05:20,181 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 87 transitions. Word has length 23 [2021-03-11 11:05:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:05:20,181 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 87 transitions. [2021-03-11 11:05:20,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-03-11 11:05:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 87 transitions. [2021-03-11 11:05:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-03-11 11:05:20,181 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:05:20,182 INFO L519 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] [2021-03-11 11:05:20,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:05:20,182 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:05:20,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:05:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash -690570646, now seen corresponding path program 3 times [2021-03-11 11:05:20,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:05:20,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330516240] [2021-03-11 11:05:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:05:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:05:20,229 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:05:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:05:20,275 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:05:20,315 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:05:20,315 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:05:20,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:05:20,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:05:20 BasicIcfg [2021-03-11 11:05:20,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:05:20,405 INFO L168 Benchmark]: Toolchain (without parser) took 14734.30 ms. Allocated memory was 255.9 MB in the beginning and 622.9 MB in the end (delta: 367.0 MB). Free memory was 233.4 MB in the beginning and 454.6 MB in the end (delta: -221.2 MB). Peak memory consumption was 145.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,405 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:05:20,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.50 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 233.0 MB in the beginning and 301.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.77 ms. Allocated memory is still 341.8 MB. Free memory was 301.9 MB in the beginning and 299.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,406 INFO L168 Benchmark]: Boogie Preprocessor took 55.39 ms. Allocated memory is still 341.8 MB. Free memory was 299.0 MB in the beginning and 296.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,406 INFO L168 Benchmark]: RCFGBuilder took 1854.92 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 296.6 MB in the beginning and 381.9 MB in the end (delta: -85.3 MB). Peak memory consumption was 62.5 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,407 INFO L168 Benchmark]: TraceAbstraction took 12128.45 ms. Allocated memory was 411.0 MB in the beginning and 622.9 MB in the end (delta: 211.8 MB). Free memory was 380.9 MB in the beginning and 454.6 MB in the end (delta: -73.7 MB). Peak memory consumption was 138.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:05:20,408 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 606.50 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 233.0 MB in the beginning and 301.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.77 ms. Allocated memory is still 341.8 MB. Free memory was 301.9 MB in the beginning and 299.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.39 ms. Allocated memory is still 341.8 MB. Free memory was 299.0 MB in the beginning and 296.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1854.92 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 296.6 MB in the beginning and 381.9 MB in the end (delta: -85.3 MB). Peak memory consumption was 62.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12128.45 ms. Allocated memory was 411.0 MB in the beginning and 622.9 MB in the end (delta: 211.8 MB). Free memory was 380.9 MB in the beginning and 454.6 MB in the end (delta: -73.7 MB). Peak memory consumption was 138.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8571.3ms, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 5204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2448, positive: 2284, positive conditional: 0, positive unconditional: 2284, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1339, positive: 1286, positive conditional: 0, positive unconditional: 1286, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1339, positive: 1262, positive conditional: 0, positive unconditional: 1262, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 977, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 913, negative conditional: 0, negative unconditional: 913, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2448, positive: 998, positive conditional: 0, positive unconditional: 998, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 1339, unknown conditional: 0, unknown unconditional: 1339] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((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] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((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] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((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] [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}, 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}, 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 y = 2 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=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=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=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=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=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=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, 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 [L787] 2 return 0; [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 [L758] 1 return 0; [L801] 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) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] 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) [L801] 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) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 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 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 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 [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 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) [L845] 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) [L846] 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)) [L846] EXPR 0 !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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] EXPR 0 !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) [L847] 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)) [L847] 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)) [L848] 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)) [L848] EXPR 0 !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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] EXPR 0 !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) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] EXPR 0 !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) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=51, weak$$choice2=0, 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=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11945.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 34.0ms, AutomataDifference: 1135.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8678.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 388 SDtfs, 442 SDslu, 831 SDs, 0 SdLazy, 402 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 527.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 540.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 246.1ms AutomataMinimizationTime, 13 MinimizatonAttempts, 110 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.2ms SsaConstructionTime, 433.8ms SatisfiabilityAnalysisTime, 1085.3ms InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...