/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:42:37,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:42:37,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:42:37,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:42:37,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:42:37,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:42:37,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:42:37,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:42:37,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:42:37,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:42:37,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:42:37,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:42:37,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:42:37,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:42:37,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:42:37,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:42:37,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:42:37,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:42:37,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:42:37,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:42:37,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:42:37,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:42:37,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:42:37,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:42:37,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:42:37,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:42:37,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:42:37,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:42:37,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:42:37,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:42:37,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:42:37,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:42:37,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:42:37,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:42:37,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:42:37,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:42:37,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:42:37,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:42:37,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:42:37,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:42:37,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:42:37,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 03:42:37,294 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:42:37,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:42:37,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:42:37,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:42:37,296 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:42:37,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:42:37,296 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:42:37,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:42:37,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:42:37,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:42:37,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:42:37,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:42:37,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:42:37,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:42:37,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:42:37,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:42:37,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:42:37,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:42:37,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:42:37,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:42:37,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:42:37,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:42:37,300 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:42:37,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:42:37,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:42:37,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:42:37,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:42:37,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:42:37,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:42:37,579 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:42:37,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-19 03:42:37,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8a791e3/90bd467c44ff4005b2c6a5160d0626fe/FLAGd68569e59 [2019-12-19 03:42:38,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:42:38,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-19 03:42:38,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8a791e3/90bd467c44ff4005b2c6a5160d0626fe/FLAGd68569e59 [2019-12-19 03:42:38,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8a791e3/90bd467c44ff4005b2c6a5160d0626fe [2019-12-19 03:42:38,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:42:38,466 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:42:38,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:42:38,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:42:38,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:42:38,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:42:38" (1/1) ... [2019-12-19 03:42:38,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9639fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:38, skipping insertion in model container [2019-12-19 03:42:38,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:42:38" (1/1) ... [2019-12-19 03:42:38,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:42:38,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:42:39,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:42:39,051 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:42:39,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:42:39,225 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:42:39,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39 WrapperNode [2019-12-19 03:42:39,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:42:39,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:42:39,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:42:39,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:42:39,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:42:39,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:42:39,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:42:39,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:42:39,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (1/1) ... [2019-12-19 03:42:39,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:42:39,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:42:39,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:42:39,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:42:39,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (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 [2019-12-19 03:42:39,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:42:39,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:42:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:42:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:42:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:42:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:42:39,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:42:39,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:42:39,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:42:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:42:39,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:42:39,452 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:42:40,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:42:40,114 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:42:40,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:42:40 BoogieIcfgContainer [2019-12-19 03:42:40,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:42:40,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:42:40,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:42:40,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:42:40,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:42:38" (1/3) ... [2019-12-19 03:42:40,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dce1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:42:40, skipping insertion in model container [2019-12-19 03:42:40,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:42:39" (2/3) ... [2019-12-19 03:42:40,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dce1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:42:40, skipping insertion in model container [2019-12-19 03:42:40,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:42:40" (3/3) ... [2019-12-19 03:42:40,126 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-19 03:42:40,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:42:40,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:42:40,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:42:40,148 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:42:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:42:40,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:42:40,256 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:42:40,256 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:42:40,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:42:40,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:42:40,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:42:40,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:42:40,257 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:42:40,257 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:42:40,273 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-19 03:42:41,762 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22495 states. [2019-12-19 03:42:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states. [2019-12-19 03:42:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-19 03:42:41,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:41,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:41,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2000435447, now seen corresponding path program 1 times [2019-12-19 03:42:41,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:41,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170928353] [2019-12-19 03:42:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:42,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170928353] [2019-12-19 03:42:42,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:42,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:42:42,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353969253] [2019-12-19 03:42:42,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:42:42,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:42,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:42:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:42:42,138 INFO L87 Difference]: Start difference. First operand 22495 states. Second operand 4 states. [2019-12-19 03:42:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:42,937 INFO L93 Difference]: Finished difference Result 23447 states and 91748 transitions. [2019-12-19 03:42:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:42:42,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-19 03:42:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:43,193 INFO L225 Difference]: With dead ends: 23447 [2019-12-19 03:42:43,193 INFO L226 Difference]: Without dead ends: 21271 [2019-12-19 03:42:43,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:42:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21271 states. [2019-12-19 03:42:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21271 to 21271. [2019-12-19 03:42:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21271 states. [2019-12-19 03:42:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 83772 transitions. [2019-12-19 03:42:45,049 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 83772 transitions. Word has length 38 [2019-12-19 03:42:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:42:45,050 INFO L462 AbstractCegarLoop]: Abstraction has 21271 states and 83772 transitions. [2019-12-19 03:42:45,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:42:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 83772 transitions. [2019-12-19 03:42:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 03:42:45,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:45,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:45,064 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1983291850, now seen corresponding path program 1 times [2019-12-19 03:42:45,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:45,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98998597] [2019-12-19 03:42:45,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:45,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98998597] [2019-12-19 03:42:45,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:45,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:42:45,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329681515] [2019-12-19 03:42:45,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:42:45,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:42:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:42:45,222 INFO L87 Difference]: Start difference. First operand 21271 states and 83772 transitions. Second operand 5 states. [2019-12-19 03:42:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:46,969 INFO L93 Difference]: Finished difference Result 34705 states and 129064 transitions. [2019-12-19 03:42:46,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:42:46,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 03:42:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:47,152 INFO L225 Difference]: With dead ends: 34705 [2019-12-19 03:42:47,152 INFO L226 Difference]: Without dead ends: 34561 [2019-12-19 03:42:47,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:42:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34561 states. [2019-12-19 03:42:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34561 to 33061. [2019-12-19 03:42:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33061 states. [2019-12-19 03:42:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33061 states to 33061 states and 123952 transitions. [2019-12-19 03:42:48,594 INFO L78 Accepts]: Start accepts. Automaton has 33061 states and 123952 transitions. Word has length 45 [2019-12-19 03:42:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:42:48,596 INFO L462 AbstractCegarLoop]: Abstraction has 33061 states and 123952 transitions. [2019-12-19 03:42:48,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:42:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33061 states and 123952 transitions. [2019-12-19 03:42:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:42:48,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:48,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:48,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash -523564923, now seen corresponding path program 1 times [2019-12-19 03:42:48,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:48,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667070475] [2019-12-19 03:42:48,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:48,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667070475] [2019-12-19 03:42:48,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:48,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:42:48,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894657085] [2019-12-19 03:42:48,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:42:48,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:42:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:42:48,694 INFO L87 Difference]: Start difference. First operand 33061 states and 123952 transitions. Second operand 5 states. [2019-12-19 03:42:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:49,251 INFO L93 Difference]: Finished difference Result 40213 states and 148621 transitions. [2019-12-19 03:42:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:42:49,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:42:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:49,442 INFO L225 Difference]: With dead ends: 40213 [2019-12-19 03:42:49,442 INFO L226 Difference]: Without dead ends: 40053 [2019-12-19 03:42:49,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:42:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40053 states. [2019-12-19 03:42:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40053 to 34634. [2019-12-19 03:42:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34634 states. [2019-12-19 03:42:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 129248 transitions. [2019-12-19 03:42:52,289 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 129248 transitions. Word has length 46 [2019-12-19 03:42:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:42:52,290 INFO L462 AbstractCegarLoop]: Abstraction has 34634 states and 129248 transitions. [2019-12-19 03:42:52,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:42:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 129248 transitions. [2019-12-19 03:42:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:42:52,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:52,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:52,305 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash 207237168, now seen corresponding path program 1 times [2019-12-19 03:42:52,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:52,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492314748] [2019-12-19 03:42:52,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:52,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492314748] [2019-12-19 03:42:52,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:52,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:42:52,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495245009] [2019-12-19 03:42:52,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:42:52,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:42:52,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:42:52,448 INFO L87 Difference]: Start difference. First operand 34634 states and 129248 transitions. Second operand 6 states. [2019-12-19 03:42:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:53,323 INFO L93 Difference]: Finished difference Result 45662 states and 166142 transitions. [2019-12-19 03:42:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:42:53,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:42:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:53,620 INFO L225 Difference]: With dead ends: 45662 [2019-12-19 03:42:53,621 INFO L226 Difference]: Without dead ends: 45518 [2019-12-19 03:42:53,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:42:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45518 states. [2019-12-19 03:42:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45518 to 33597. [2019-12-19 03:42:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33597 states. [2019-12-19 03:42:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 125403 transitions. [2019-12-19 03:42:55,977 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 125403 transitions. Word has length 53 [2019-12-19 03:42:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:42:55,978 INFO L462 AbstractCegarLoop]: Abstraction has 33597 states and 125403 transitions. [2019-12-19 03:42:55,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:42:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 125403 transitions. [2019-12-19 03:42:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:42:56,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:56,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:56,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1087106870, now seen corresponding path program 1 times [2019-12-19 03:42:56,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:56,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624614782] [2019-12-19 03:42:56,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:56,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624614782] [2019-12-19 03:42:56,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:56,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:42:56,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276571627] [2019-12-19 03:42:56,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:42:56,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:56,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:42:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:42:56,135 INFO L87 Difference]: Start difference. First operand 33597 states and 125403 transitions. Second operand 6 states. [2019-12-19 03:42:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:57,060 INFO L93 Difference]: Finished difference Result 46069 states and 167836 transitions. [2019-12-19 03:42:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:42:57,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 03:42:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:57,266 INFO L225 Difference]: With dead ends: 46069 [2019-12-19 03:42:57,266 INFO L226 Difference]: Without dead ends: 45829 [2019-12-19 03:42:57,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:42:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45829 states. [2019-12-19 03:42:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45829 to 39958. [2019-12-19 03:42:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-19 03:42:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 147327 transitions. [2019-12-19 03:42:58,482 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 147327 transitions. Word has length 60 [2019-12-19 03:42:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:42:58,483 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 147327 transitions. [2019-12-19 03:42:58,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:42:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 147327 transitions. [2019-12-19 03:42:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 03:42:58,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:42:58,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:42:58,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:42:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:42:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2146511321, now seen corresponding path program 1 times [2019-12-19 03:42:58,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:42:58,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931412840] [2019-12-19 03:42:58,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:42:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:42:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:42:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931412840] [2019-12-19 03:42:58,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:42:58,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:42:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538272619] [2019-12-19 03:42:58,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:42:58,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:42:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:42:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:42:58,573 INFO L87 Difference]: Start difference. First operand 39958 states and 147327 transitions. Second operand 3 states. [2019-12-19 03:42:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:42:58,832 INFO L93 Difference]: Finished difference Result 50256 states and 182162 transitions. [2019-12-19 03:42:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:42:58,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-19 03:42:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:42:58,976 INFO L225 Difference]: With dead ends: 50256 [2019-12-19 03:42:58,976 INFO L226 Difference]: Without dead ends: 50256 [2019-12-19 03:42:58,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:42:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2019-12-19 03:43:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 43888. [2019-12-19 03:43:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43888 states. [2019-12-19 03:43:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43888 states to 43888 states and 160765 transitions. [2019-12-19 03:43:01,652 INFO L78 Accepts]: Start accepts. Automaton has 43888 states and 160765 transitions. Word has length 62 [2019-12-19 03:43:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:01,652 INFO L462 AbstractCegarLoop]: Abstraction has 43888 states and 160765 transitions. [2019-12-19 03:43:01,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:43:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43888 states and 160765 transitions. [2019-12-19 03:43:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:43:01,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:01,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:01,686 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:01,687 INFO L82 PathProgramCache]: Analyzing trace with hash 388648113, now seen corresponding path program 1 times [2019-12-19 03:43:01,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:01,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823971462] [2019-12-19 03:43:01,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:01,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823971462] [2019-12-19 03:43:01,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:01,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:43:01,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602240135] [2019-12-19 03:43:01,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:43:01,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:43:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:01,792 INFO L87 Difference]: Start difference. First operand 43888 states and 160765 transitions. Second operand 7 states. [2019-12-19 03:43:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:03,088 INFO L93 Difference]: Finished difference Result 55884 states and 200499 transitions. [2019-12-19 03:43:03,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:43:03,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 03:43:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:03,214 INFO L225 Difference]: With dead ends: 55884 [2019-12-19 03:43:03,214 INFO L226 Difference]: Without dead ends: 55644 [2019-12-19 03:43:03,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 03:43:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55644 states. [2019-12-19 03:43:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55644 to 45114. [2019-12-19 03:43:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45114 states. [2019-12-19 03:43:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45114 states to 45114 states and 164932 transitions. [2019-12-19 03:43:04,465 INFO L78 Accepts]: Start accepts. Automaton has 45114 states and 164932 transitions. Word has length 66 [2019-12-19 03:43:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:04,465 INFO L462 AbstractCegarLoop]: Abstraction has 45114 states and 164932 transitions. [2019-12-19 03:43:04,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:43:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 45114 states and 164932 transitions. [2019-12-19 03:43:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:43:04,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:04,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:04,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -119877727, now seen corresponding path program 1 times [2019-12-19 03:43:04,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:04,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707022251] [2019-12-19 03:43:04,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:04,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707022251] [2019-12-19 03:43:04,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:04,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:43:04,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065756994] [2019-12-19 03:43:04,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:43:04,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:43:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:04,599 INFO L87 Difference]: Start difference. First operand 45114 states and 164932 transitions. Second operand 7 states. [2019-12-19 03:43:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:05,758 INFO L93 Difference]: Finished difference Result 55098 states and 197676 transitions. [2019-12-19 03:43:05,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:43:05,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:43:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:05,869 INFO L225 Difference]: With dead ends: 55098 [2019-12-19 03:43:05,869 INFO L226 Difference]: Without dead ends: 54898 [2019-12-19 03:43:05,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:43:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2019-12-19 03:43:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 45992. [2019-12-19 03:43:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45992 states. [2019-12-19 03:43:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45992 states to 45992 states and 167803 transitions. [2019-12-19 03:43:08,594 INFO L78 Accepts]: Start accepts. Automaton has 45992 states and 167803 transitions. Word has length 67 [2019-12-19 03:43:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 45992 states and 167803 transitions. [2019-12-19 03:43:08,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:43:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 45992 states and 167803 transitions. [2019-12-19 03:43:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:43:08,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:08,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:08,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 847444268, now seen corresponding path program 1 times [2019-12-19 03:43:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:08,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811785556] [2019-12-19 03:43:08,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:08,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811785556] [2019-12-19 03:43:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:08,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:43:08,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756973123] [2019-12-19 03:43:08,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:43:08,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:43:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:43:08,676 INFO L87 Difference]: Start difference. First operand 45992 states and 167803 transitions. Second operand 3 states. [2019-12-19 03:43:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:09,460 INFO L93 Difference]: Finished difference Result 61486 states and 224137 transitions. [2019-12-19 03:43:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:43:09,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 03:43:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:09,598 INFO L225 Difference]: With dead ends: 61486 [2019-12-19 03:43:09,598 INFO L226 Difference]: Without dead ends: 61486 [2019-12-19 03:43:09,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:43:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61486 states. [2019-12-19 03:43:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61486 to 53433. [2019-12-19 03:43:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53433 states. [2019-12-19 03:43:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53433 states to 53433 states and 195616 transitions. [2019-12-19 03:43:13,184 INFO L78 Accepts]: Start accepts. Automaton has 53433 states and 195616 transitions. Word has length 69 [2019-12-19 03:43:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:13,184 INFO L462 AbstractCegarLoop]: Abstraction has 53433 states and 195616 transitions. [2019-12-19 03:43:13,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:43:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 53433 states and 195616 transitions. [2019-12-19 03:43:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:43:13,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:13,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:13,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1922866772, now seen corresponding path program 1 times [2019-12-19 03:43:13,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:13,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189227073] [2019-12-19 03:43:13,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:13,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189227073] [2019-12-19 03:43:13,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:13,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:13,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557719645] [2019-12-19 03:43:13,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:13,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:13,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:13,376 INFO L87 Difference]: Start difference. First operand 53433 states and 195616 transitions. Second operand 6 states. [2019-12-19 03:43:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:14,238 INFO L93 Difference]: Finished difference Result 65982 states and 238830 transitions. [2019-12-19 03:43:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:43:14,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 03:43:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:14,379 INFO L225 Difference]: With dead ends: 65982 [2019-12-19 03:43:14,379 INFO L226 Difference]: Without dead ends: 65338 [2019-12-19 03:43:14,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65338 states. [2019-12-19 03:43:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65338 to 56042. [2019-12-19 03:43:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56042 states. [2019-12-19 03:43:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 204333 transitions. [2019-12-19 03:43:15,697 INFO L78 Accepts]: Start accepts. Automaton has 56042 states and 204333 transitions. Word has length 69 [2019-12-19 03:43:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:15,697 INFO L462 AbstractCegarLoop]: Abstraction has 56042 states and 204333 transitions. [2019-12-19 03:43:15,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 56042 states and 204333 transitions. [2019-12-19 03:43:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:43:15,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:15,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:15,750 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash -961252755, now seen corresponding path program 1 times [2019-12-19 03:43:15,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:15,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748527549] [2019-12-19 03:43:15,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:15,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748527549] [2019-12-19 03:43:15,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:15,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:43:15,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067459311] [2019-12-19 03:43:15,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:43:15,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:43:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:15,888 INFO L87 Difference]: Start difference. First operand 56042 states and 204333 transitions. Second operand 7 states. [2019-12-19 03:43:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:17,091 INFO L93 Difference]: Finished difference Result 83030 states and 292761 transitions. [2019-12-19 03:43:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:43:17,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 03:43:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:17,261 INFO L225 Difference]: With dead ends: 83030 [2019-12-19 03:43:17,262 INFO L226 Difference]: Without dead ends: 83030 [2019-12-19 03:43:17,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:43:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83030 states. [2019-12-19 03:43:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83030 to 76079. [2019-12-19 03:43:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-12-19 03:43:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 270628 transitions. [2019-12-19 03:43:19,266 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 270628 transitions. Word has length 69 [2019-12-19 03:43:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:19,266 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 270628 transitions. [2019-12-19 03:43:19,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:43:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 270628 transitions. [2019-12-19 03:43:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:43:19,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:19,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:19,323 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 283511726, now seen corresponding path program 1 times [2019-12-19 03:43:19,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:19,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448237326] [2019-12-19 03:43:19,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:19,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448237326] [2019-12-19 03:43:19,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:19,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:43:19,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843038147] [2019-12-19 03:43:19,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:43:19,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:43:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:43:19,381 INFO L87 Difference]: Start difference. First operand 76079 states and 270628 transitions. Second operand 3 states. [2019-12-19 03:43:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:21,759 INFO L93 Difference]: Finished difference Result 54415 states and 197409 transitions. [2019-12-19 03:43:21,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:43:21,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 03:43:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:21,887 INFO L225 Difference]: With dead ends: 54415 [2019-12-19 03:43:21,887 INFO L226 Difference]: Without dead ends: 54253 [2019-12-19 03:43:21,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:43:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54253 states. [2019-12-19 03:43:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54253 to 54213. [2019-12-19 03:43:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54213 states. [2019-12-19 03:43:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54213 states to 54213 states and 196824 transitions. [2019-12-19 03:43:22,863 INFO L78 Accepts]: Start accepts. Automaton has 54213 states and 196824 transitions. Word has length 69 [2019-12-19 03:43:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:22,863 INFO L462 AbstractCegarLoop]: Abstraction has 54213 states and 196824 transitions. [2019-12-19 03:43:22,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:43:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 54213 states and 196824 transitions. [2019-12-19 03:43:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:43:22,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:22,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:22,902 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:22,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1427518339, now seen corresponding path program 1 times [2019-12-19 03:43:22,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:22,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677731812] [2019-12-19 03:43:22,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:23,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677731812] [2019-12-19 03:43:23,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:23,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:43:23,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798271310] [2019-12-19 03:43:23,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:43:23,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:43:23,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:23,005 INFO L87 Difference]: Start difference. First operand 54213 states and 196824 transitions. Second operand 5 states. [2019-12-19 03:43:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:24,175 INFO L93 Difference]: Finished difference Result 84428 states and 303656 transitions. [2019-12-19 03:43:24,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:43:24,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 03:43:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:24,373 INFO L225 Difference]: With dead ends: 84428 [2019-12-19 03:43:24,373 INFO L226 Difference]: Without dead ends: 84232 [2019-12-19 03:43:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84232 states. [2019-12-19 03:43:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84232 to 76147. [2019-12-19 03:43:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76147 states. [2019-12-19 03:43:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76147 states to 76147 states and 275544 transitions. [2019-12-19 03:43:28,752 INFO L78 Accepts]: Start accepts. Automaton has 76147 states and 275544 transitions. Word has length 70 [2019-12-19 03:43:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:28,752 INFO L462 AbstractCegarLoop]: Abstraction has 76147 states and 275544 transitions. [2019-12-19 03:43:28,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:43:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 76147 states and 275544 transitions. [2019-12-19 03:43:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:43:28,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:28,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:28,828 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:28,829 INFO L82 PathProgramCache]: Analyzing trace with hash -182753858, now seen corresponding path program 1 times [2019-12-19 03:43:28,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:28,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303330097] [2019-12-19 03:43:28,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:28,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303330097] [2019-12-19 03:43:28,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:28,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:43:28,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40209015] [2019-12-19 03:43:28,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:43:28,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:43:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:28,926 INFO L87 Difference]: Start difference. First operand 76147 states and 275544 transitions. Second operand 5 states. [2019-12-19 03:43:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:29,074 INFO L93 Difference]: Finished difference Result 19615 states and 62265 transitions. [2019-12-19 03:43:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:43:29,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 03:43:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:29,118 INFO L225 Difference]: With dead ends: 19615 [2019-12-19 03:43:29,118 INFO L226 Difference]: Without dead ends: 19137 [2019-12-19 03:43:29,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19137 states. [2019-12-19 03:43:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19137 to 19125. [2019-12-19 03:43:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19125 states. [2019-12-19 03:43:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19125 states to 19125 states and 60760 transitions. [2019-12-19 03:43:29,532 INFO L78 Accepts]: Start accepts. Automaton has 19125 states and 60760 transitions. Word has length 70 [2019-12-19 03:43:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:29,533 INFO L462 AbstractCegarLoop]: Abstraction has 19125 states and 60760 transitions. [2019-12-19 03:43:29,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:43:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19125 states and 60760 transitions. [2019-12-19 03:43:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 03:43:29,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:29,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:29,558 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash 407506969, now seen corresponding path program 1 times [2019-12-19 03:43:29,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:29,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726512414] [2019-12-19 03:43:29,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:29,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726512414] [2019-12-19 03:43:29,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:29,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:43:29,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432953130] [2019-12-19 03:43:29,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:43:29,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:43:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:43:29,652 INFO L87 Difference]: Start difference. First operand 19125 states and 60760 transitions. Second operand 4 states. [2019-12-19 03:43:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:29,894 INFO L93 Difference]: Finished difference Result 24075 states and 75428 transitions. [2019-12-19 03:43:29,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:43:29,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 03:43:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:29,930 INFO L225 Difference]: With dead ends: 24075 [2019-12-19 03:43:29,931 INFO L226 Difference]: Without dead ends: 24075 [2019-12-19 03:43:29,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24075 states. [2019-12-19 03:43:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24075 to 19965. [2019-12-19 03:43:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19965 states. [2019-12-19 03:43:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19965 states to 19965 states and 63127 transitions. [2019-12-19 03:43:30,210 INFO L78 Accepts]: Start accepts. Automaton has 19965 states and 63127 transitions. Word has length 79 [2019-12-19 03:43:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:30,210 INFO L462 AbstractCegarLoop]: Abstraction has 19965 states and 63127 transitions. [2019-12-19 03:43:30,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:43:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19965 states and 63127 transitions. [2019-12-19 03:43:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 03:43:30,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:30,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:30,226 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 152770424, now seen corresponding path program 1 times [2019-12-19 03:43:30,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:30,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724618194] [2019-12-19 03:43:30,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:30,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724618194] [2019-12-19 03:43:30,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:30,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:43:30,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756252673] [2019-12-19 03:43:30,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:43:30,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:30,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:43:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:30,327 INFO L87 Difference]: Start difference. First operand 19965 states and 63127 transitions. Second operand 8 states. [2019-12-19 03:43:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:31,633 INFO L93 Difference]: Finished difference Result 22071 states and 69319 transitions. [2019-12-19 03:43:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 03:43:31,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-12-19 03:43:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:31,674 INFO L225 Difference]: With dead ends: 22071 [2019-12-19 03:43:31,674 INFO L226 Difference]: Without dead ends: 22023 [2019-12-19 03:43:31,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-19 03:43:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2019-12-19 03:43:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 19437. [2019-12-19 03:43:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19437 states. [2019-12-19 03:43:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19437 states to 19437 states and 61629 transitions. [2019-12-19 03:43:31,956 INFO L78 Accepts]: Start accepts. Automaton has 19437 states and 61629 transitions. Word has length 79 [2019-12-19 03:43:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:31,957 INFO L462 AbstractCegarLoop]: Abstraction has 19437 states and 61629 transitions. [2019-12-19 03:43:31,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:43:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19437 states and 61629 transitions. [2019-12-19 03:43:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:43:31,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:31,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:31,976 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 295981230, now seen corresponding path program 1 times [2019-12-19 03:43:31,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:31,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150771524] [2019-12-19 03:43:31,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:32,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150771524] [2019-12-19 03:43:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:32,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:43:32,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568286268] [2019-12-19 03:43:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:43:32,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:43:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:32,071 INFO L87 Difference]: Start difference. First operand 19437 states and 61629 transitions. Second operand 8 states. [2019-12-19 03:43:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:34,524 INFO L93 Difference]: Finished difference Result 50431 states and 153647 transitions. [2019-12-19 03:43:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 03:43:34,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-19 03:43:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:34,597 INFO L225 Difference]: With dead ends: 50431 [2019-12-19 03:43:34,597 INFO L226 Difference]: Without dead ends: 49732 [2019-12-19 03:43:34,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 03:43:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49732 states. [2019-12-19 03:43:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49732 to 29965. [2019-12-19 03:43:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-19 03:43:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93559 transitions. [2019-12-19 03:43:35,104 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93559 transitions. Word has length 82 [2019-12-19 03:43:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:35,104 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93559 transitions. [2019-12-19 03:43:35,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:43:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93559 transitions. [2019-12-19 03:43:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:43:35,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:35,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:35,131 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1257595247, now seen corresponding path program 1 times [2019-12-19 03:43:35,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:35,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489964845] [2019-12-19 03:43:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:35,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489964845] [2019-12-19 03:43:35,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:35,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:35,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154763329] [2019-12-19 03:43:35,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:35,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:35,225 INFO L87 Difference]: Start difference. First operand 29965 states and 93559 transitions. Second operand 6 states. [2019-12-19 03:43:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:36,266 INFO L93 Difference]: Finished difference Result 31403 states and 97496 transitions. [2019-12-19 03:43:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:43:36,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-19 03:43:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:36,333 INFO L225 Difference]: With dead ends: 31403 [2019-12-19 03:43:36,334 INFO L226 Difference]: Without dead ends: 31403 [2019-12-19 03:43:36,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31403 states. [2019-12-19 03:43:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31403 to 29634. [2019-12-19 03:43:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29634 states. [2019-12-19 03:43:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29634 states to 29634 states and 92402 transitions. [2019-12-19 03:43:36,804 INFO L78 Accepts]: Start accepts. Automaton has 29634 states and 92402 transitions. Word has length 82 [2019-12-19 03:43:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:36,805 INFO L462 AbstractCegarLoop]: Abstraction has 29634 states and 92402 transitions. [2019-12-19 03:43:36,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29634 states and 92402 transitions. [2019-12-19 03:43:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:43:36,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:36,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:36,834 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -678065040, now seen corresponding path program 1 times [2019-12-19 03:43:36,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:36,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384249851] [2019-12-19 03:43:36,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:36,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384249851] [2019-12-19 03:43:36,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:36,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:43:36,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176383499] [2019-12-19 03:43:36,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:43:36,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:43:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:36,960 INFO L87 Difference]: Start difference. First operand 29634 states and 92402 transitions. Second operand 7 states. [2019-12-19 03:43:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:37,615 INFO L93 Difference]: Finished difference Result 31148 states and 96558 transitions. [2019-12-19 03:43:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:43:37,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-19 03:43:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:37,667 INFO L225 Difference]: With dead ends: 31148 [2019-12-19 03:43:37,667 INFO L226 Difference]: Without dead ends: 31148 [2019-12-19 03:43:37,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:43:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31148 states. [2019-12-19 03:43:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31148 to 29966. [2019-12-19 03:43:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-19 03:43:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93233 transitions. [2019-12-19 03:43:38,094 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93233 transitions. Word has length 82 [2019-12-19 03:43:38,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:38,094 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93233 transitions. [2019-12-19 03:43:38,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:43:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93233 transitions. [2019-12-19 03:43:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:43:38,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:38,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:38,124 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash -348299279, now seen corresponding path program 1 times [2019-12-19 03:43:38,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:38,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502552379] [2019-12-19 03:43:38,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:38,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502552379] [2019-12-19 03:43:38,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:38,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:43:38,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322879458] [2019-12-19 03:43:38,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:43:38,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:43:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:38,216 INFO L87 Difference]: Start difference. First operand 29966 states and 93233 transitions. Second operand 5 states. [2019-12-19 03:43:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:38,267 INFO L93 Difference]: Finished difference Result 4529 states and 11169 transitions. [2019-12-19 03:43:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:43:38,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-19 03:43:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:38,273 INFO L225 Difference]: With dead ends: 4529 [2019-12-19 03:43:38,273 INFO L226 Difference]: Without dead ends: 3739 [2019-12-19 03:43:38,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2019-12-19 03:43:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3436. [2019-12-19 03:43:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-12-19 03:43:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 8370 transitions. [2019-12-19 03:43:38,325 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 8370 transitions. Word has length 82 [2019-12-19 03:43:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:38,325 INFO L462 AbstractCegarLoop]: Abstraction has 3436 states and 8370 transitions. [2019-12-19 03:43:38,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:43:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 8370 transitions. [2019-12-19 03:43:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:43:38,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:38,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:38,330 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash -933932185, now seen corresponding path program 1 times [2019-12-19 03:43:38,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:38,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002155739] [2019-12-19 03:43:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:38,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002155739] [2019-12-19 03:43:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:38,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:38,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988240041] [2019-12-19 03:43:38,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:38,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:38,423 INFO L87 Difference]: Start difference. First operand 3436 states and 8370 transitions. Second operand 6 states. [2019-12-19 03:43:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:38,805 INFO L93 Difference]: Finished difference Result 3715 states and 8918 transitions. [2019-12-19 03:43:38,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:43:38,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 03:43:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:38,810 INFO L225 Difference]: With dead ends: 3715 [2019-12-19 03:43:38,811 INFO L226 Difference]: Without dead ends: 3669 [2019-12-19 03:43:38,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-19 03:43:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3579. [2019-12-19 03:43:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3579 states. [2019-12-19 03:43:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 8657 transitions. [2019-12-19 03:43:38,844 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 8657 transitions. Word has length 94 [2019-12-19 03:43:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:38,844 INFO L462 AbstractCegarLoop]: Abstraction has 3579 states and 8657 transitions. [2019-12-19 03:43:38,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 8657 transitions. [2019-12-19 03:43:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:43:38,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:38,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:38,848 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1174472314, now seen corresponding path program 1 times [2019-12-19 03:43:38,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:38,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491675545] [2019-12-19 03:43:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:38,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491675545] [2019-12-19 03:43:38,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:38,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:43:38,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517644370] [2019-12-19 03:43:38,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:43:38,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:38,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:43:38,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:38,920 INFO L87 Difference]: Start difference. First operand 3579 states and 8657 transitions. Second operand 5 states. [2019-12-19 03:43:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:39,136 INFO L93 Difference]: Finished difference Result 4417 states and 10488 transitions. [2019-12-19 03:43:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:43:39,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 03:43:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:39,141 INFO L225 Difference]: With dead ends: 4417 [2019-12-19 03:43:39,141 INFO L226 Difference]: Without dead ends: 4376 [2019-12-19 03:43:39,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:43:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2019-12-19 03:43:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 3844. [2019-12-19 03:43:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-19 03:43:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 9230 transitions. [2019-12-19 03:43:39,178 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 9230 transitions. Word has length 94 [2019-12-19 03:43:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 9230 transitions. [2019-12-19 03:43:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:43:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 9230 transitions. [2019-12-19 03:43:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:43:39,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:39,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:39,182 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1749114760, now seen corresponding path program 1 times [2019-12-19 03:43:39,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:39,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933803666] [2019-12-19 03:43:39,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:39,541 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 9 [2019-12-19 03:43:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:39,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933803666] [2019-12-19 03:43:39,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:39,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:43:39,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380934191] [2019-12-19 03:43:39,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:43:39,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:43:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:39,562 INFO L87 Difference]: Start difference. First operand 3844 states and 9230 transitions. Second operand 7 states. [2019-12-19 03:43:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:39,916 INFO L93 Difference]: Finished difference Result 3030 states and 7276 transitions. [2019-12-19 03:43:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:43:39,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-19 03:43:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:39,921 INFO L225 Difference]: With dead ends: 3030 [2019-12-19 03:43:39,922 INFO L226 Difference]: Without dead ends: 3030 [2019-12-19 03:43:39,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:43:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-12-19 03:43:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2824. [2019-12-19 03:43:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-12-19 03:43:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 6854 transitions. [2019-12-19 03:43:39,951 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 6854 transitions. Word has length 94 [2019-12-19 03:43:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:39,951 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 6854 transitions. [2019-12-19 03:43:39,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:43:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 6854 transitions. [2019-12-19 03:43:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:39,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:39,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:39,954 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2144657418, now seen corresponding path program 1 times [2019-12-19 03:43:39,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:39,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872134665] [2019-12-19 03:43:39,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:40,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872134665] [2019-12-19 03:43:40,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:40,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:40,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381611595] [2019-12-19 03:43:40,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:40,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:40,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:40,069 INFO L87 Difference]: Start difference. First operand 2824 states and 6854 transitions. Second operand 6 states. [2019-12-19 03:43:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:40,165 INFO L93 Difference]: Finished difference Result 2982 states and 7115 transitions. [2019-12-19 03:43:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:43:40,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-19 03:43:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:40,169 INFO L225 Difference]: With dead ends: 2982 [2019-12-19 03:43:40,170 INFO L226 Difference]: Without dead ends: 2939 [2019-12-19 03:43:40,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-12-19 03:43:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2764. [2019-12-19 03:43:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2019-12-19 03:43:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 6668 transitions. [2019-12-19 03:43:40,214 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 6668 transitions. Word has length 96 [2019-12-19 03:43:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:40,214 INFO L462 AbstractCegarLoop]: Abstraction has 2764 states and 6668 transitions. [2019-12-19 03:43:40,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 6668 transitions. [2019-12-19 03:43:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:40,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:40,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:40,219 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 449569399, now seen corresponding path program 1 times [2019-12-19 03:43:40,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:40,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911038013] [2019-12-19 03:43:40,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:40,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911038013] [2019-12-19 03:43:40,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:40,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:40,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918248111] [2019-12-19 03:43:40,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:40,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:40,331 INFO L87 Difference]: Start difference. First operand 2764 states and 6668 transitions. Second operand 6 states. [2019-12-19 03:43:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:40,591 INFO L93 Difference]: Finished difference Result 2922 states and 6943 transitions. [2019-12-19 03:43:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:43:40,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-19 03:43:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:40,596 INFO L225 Difference]: With dead ends: 2922 [2019-12-19 03:43:40,596 INFO L226 Difference]: Without dead ends: 2922 [2019-12-19 03:43:40,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:43:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-12-19 03:43:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2788. [2019-12-19 03:43:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2019-12-19 03:43:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 6685 transitions. [2019-12-19 03:43:40,646 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 6685 transitions. Word has length 96 [2019-12-19 03:43:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:40,647 INFO L462 AbstractCegarLoop]: Abstraction has 2788 states and 6685 transitions. [2019-12-19 03:43:40,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 6685 transitions. [2019-12-19 03:43:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:40,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:40,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:40,652 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1486090888, now seen corresponding path program 1 times [2019-12-19 03:43:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290087] [2019-12-19 03:43:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:40,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290087] [2019-12-19 03:43:40,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:40,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:43:40,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817946958] [2019-12-19 03:43:40,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:43:40,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:43:40,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:43:40,715 INFO L87 Difference]: Start difference. First operand 2788 states and 6685 transitions. Second operand 4 states. [2019-12-19 03:43:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:40,801 INFO L93 Difference]: Finished difference Result 2212 states and 5161 transitions. [2019-12-19 03:43:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:43:40,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 03:43:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:40,805 INFO L225 Difference]: With dead ends: 2212 [2019-12-19 03:43:40,805 INFO L226 Difference]: Without dead ends: 2212 [2019-12-19 03:43:40,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2019-12-19 03:43:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2074. [2019-12-19 03:43:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-19 03:43:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4872 transitions. [2019-12-19 03:43:40,838 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4872 transitions. Word has length 96 [2019-12-19 03:43:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4872 transitions. [2019-12-19 03:43:40,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:43:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4872 transitions. [2019-12-19 03:43:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:40,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:40,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:40,842 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash 515622103, now seen corresponding path program 1 times [2019-12-19 03:43:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:40,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699948736] [2019-12-19 03:43:40,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:40,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699948736] [2019-12-19 03:43:40,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:40,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:43:40,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392277913] [2019-12-19 03:43:40,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:43:40,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:43:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:43:40,931 INFO L87 Difference]: Start difference. First operand 2074 states and 4872 transitions. Second operand 5 states. [2019-12-19 03:43:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:41,124 INFO L93 Difference]: Finished difference Result 2326 states and 5451 transitions. [2019-12-19 03:43:41,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:43:41,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 03:43:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:41,128 INFO L225 Difference]: With dead ends: 2326 [2019-12-19 03:43:41,129 INFO L226 Difference]: Without dead ends: 2308 [2019-12-19 03:43:41,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:43:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2019-12-19 03:43:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2101. [2019-12-19 03:43:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-19 03:43:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4926 transitions. [2019-12-19 03:43:41,160 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4926 transitions. Word has length 96 [2019-12-19 03:43:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:41,161 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4926 transitions. [2019-12-19 03:43:41,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:43:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4926 transitions. [2019-12-19 03:43:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:41,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:41,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:41,164 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1760386584, now seen corresponding path program 1 times [2019-12-19 03:43:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886688700] [2019-12-19 03:43:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:43:41,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886688700] [2019-12-19 03:43:41,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:41,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:43:41,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648240370] [2019-12-19 03:43:41,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:43:41,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:43:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:43:41,270 INFO L87 Difference]: Start difference. First operand 2101 states and 4926 transitions. Second operand 6 states. [2019-12-19 03:43:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:43:41,338 INFO L93 Difference]: Finished difference Result 3417 states and 8114 transitions. [2019-12-19 03:43:41,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:43:41,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-19 03:43:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:43:41,341 INFO L225 Difference]: With dead ends: 3417 [2019-12-19 03:43:41,341 INFO L226 Difference]: Without dead ends: 1399 [2019-12-19 03:43:41,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:43:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-12-19 03:43:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1399. [2019-12-19 03:43:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-12-19 03:43:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 3324 transitions. [2019-12-19 03:43:41,360 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 3324 transitions. Word has length 96 [2019-12-19 03:43:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:43:41,361 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 3324 transitions. [2019-12-19 03:43:41,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:43:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 3324 transitions. [2019-12-19 03:43:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:43:41,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:41,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:41,363 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 675950189, now seen corresponding path program 1 times [2019-12-19 03:43:41,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:41,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261025595] [2019-12-19 03:43:41,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:43:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:43:41,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:43:41,494 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:43:41,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:43:41 BasicIcfg [2019-12-19 03:43:41,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:43:41,726 INFO L168 Benchmark]: Toolchain (without parser) took 63260.91 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,729 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.17 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.14 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,736 INFO L168 Benchmark]: Boogie Preprocessor took 40.89 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,736 INFO L168 Benchmark]: RCFGBuilder took 757.21 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,737 INFO L168 Benchmark]: TraceAbstraction took 61607.06 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 107.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 03:43:41,740 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.17 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.14 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.89 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 757.21 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61607.06 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 107.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L786] 0 pthread_t t1587; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L788] 0 pthread_t t1588; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] 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) [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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 [L764] 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) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L766] 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 [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 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 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] 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) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] 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) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] 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) [L796] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L797] 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 [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] 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 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 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) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 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) [L807] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L807] 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)) [L808] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L808] 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)) [L809] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L809] 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)) [L810] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L810] 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)) [L811] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L811] 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)) [L812] 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)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L812] 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)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L814] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L814] 0 x = x$flush_delayed ? x$mem_tmp : x [L815] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7547 SDtfs, 7844 SDslu, 17759 SDs, 0 SdLazy, 8398 SolverSat, 577 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 79 SyntacticMatches, 20 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76147occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 114151 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2197 NumberOfCodeBlocks, 2197 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2073 ConstructedInterpolants, 0 QuantifiedInterpolants, 385201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...