/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:30:07,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:30:07,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:30:07,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:30:07,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:30:07,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:30:07,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:30:07,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:30:07,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:30:07,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:30:07,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:30:07,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:30:07,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:30:07,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:30:07,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:30:07,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:30:07,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:30:07,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:30:07,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:30:07,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:30:07,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:30:07,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:30:07,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:30:07,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:30:07,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:30:07,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:30:07,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:30:07,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:30:07,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:30:07,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:30:07,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:30:07,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:30:07,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:30:07,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:30:07,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:30:07,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:30:07,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:30:07,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:30:07,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:30:07,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:30:07,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:30:07,298 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-MCR.epf [2019-12-28 02:30:07,328 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:30:07,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:30:07,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:30:07,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:30:07,330 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:30:07,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:30:07,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:30:07,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:30:07,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:30:07,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:30:07,332 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:30:07,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:30:07,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:30:07,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:30:07,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:30:07,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:30:07,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:30:07,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:30:07,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:30:07,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:30:07,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:30:07,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:30:07,335 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:30:07,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:30:07,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:30:07,335 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:30:07,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:30:07,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:30:07,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:30:07,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:30:07,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:30:07,691 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:30:07,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-28 02:30:07,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c40d3dac/5ff179e895f242d3ad1c7dd7ac24e428/FLAG5087dd2cc [2019-12-28 02:30:08,341 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:30:08,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-28 02:30:08,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c40d3dac/5ff179e895f242d3ad1c7dd7ac24e428/FLAG5087dd2cc [2019-12-28 02:30:08,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c40d3dac/5ff179e895f242d3ad1c7dd7ac24e428 [2019-12-28 02:30:08,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:30:08,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:30:08,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:30:08,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:30:08,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:30:08,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:30:08" (1/1) ... [2019-12-28 02:30:08,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:08, skipping insertion in model container [2019-12-28 02:30:08,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:30:08" (1/1) ... [2019-12-28 02:30:08,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:30:08,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:30:09,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:30:09,245 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:30:09,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:30:09,388 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:30:09,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09 WrapperNode [2019-12-28 02:30:09,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:30:09,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:30:09,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:30:09,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:30:09,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:30:09,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:30:09,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:30:09,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:30:09,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (1/1) ... [2019-12-28 02:30:09,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:30:09,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:30:09,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:30:09,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:30:09,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (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-28 02:30:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:30:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:30:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:30:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:30:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:30:09,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:30:09,579 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 02:30:10,336 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:30:10,337 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:30:10,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:30:10 BoogieIcfgContainer [2019-12-28 02:30:10,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:30:10,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:30:10,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:30:10,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:30:10,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:30:08" (1/3) ... [2019-12-28 02:30:10,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5961df15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:30:10, skipping insertion in model container [2019-12-28 02:30:10,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:30:09" (2/3) ... [2019-12-28 02:30:10,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5961df15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:30:10, skipping insertion in model container [2019-12-28 02:30:10,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:30:10" (3/3) ... [2019-12-28 02:30:10,353 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2019-12-28 02:30:10,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:30:10,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:30:10,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:30:10,377 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:30:10,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,422 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,423 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:30:10,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:30:10,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:30:10,487 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:30:10,487 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:30:10,487 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:30:10,487 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:30:10,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:30:10,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:30:10,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:30:10,503 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 02:30:11,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-28 02:30:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-28 02:30:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 02:30:11,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:11,970 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] [2019-12-28 02:30:11,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 697146637, now seen corresponding path program 1 times [2019-12-28 02:30:11,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:11,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311046092] [2019-12-28 02:30:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:12,308 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-28 02:30:12,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311046092] [2019-12-28 02:30:12,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:12,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:30:12,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473830122] [2019-12-28 02:30:12,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:12,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:12,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 02:30:12,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:12,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:12,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:30:12,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:30:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:30:12,362 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-28 02:30:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:13,130 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-28 02:30:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:30:13,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 02:30:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:13,381 INFO L225 Difference]: With dead ends: 23448 [2019-12-28 02:30:13,382 INFO L226 Difference]: Without dead ends: 21272 [2019-12-28 02:30:13,385 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-28 02:30:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-28 02:30:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-28 02:30:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-28 02:30:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-28 02:30:15,344 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-28 02:30:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:15,345 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-28 02:30:15,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:30:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-28 02:30:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 02:30:15,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:15,358 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-28 02:30:15,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1403469956, now seen corresponding path program 1 times [2019-12-28 02:30:15,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:15,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031324512] [2019-12-28 02:30:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:15,534 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-28 02:30:15,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031324512] [2019-12-28 02:30:15,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:15,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:30:15,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536184413] [2019-12-28 02:30:15,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:15,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:15,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 102 transitions. [2019-12-28 02:30:15,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:15,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:30:15,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:30:15,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:30:15,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:30:15,614 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 6 states. [2019-12-28 02:30:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:16,797 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-28 02:30:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:30:16,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-28 02:30:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:16,961 INFO L225 Difference]: With dead ends: 34706 [2019-12-28 02:30:16,961 INFO L226 Difference]: Without dead ends: 34562 [2019-12-28 02:30:16,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:30:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-28 02:30:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-28 02:30:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-28 02:30:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-28 02:30:19,444 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-28 02:30:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:19,445 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-28 02:30:19,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:30:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-28 02:30:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 02:30:19,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:19,450 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] [2019-12-28 02:30:19,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 227456424, now seen corresponding path program 1 times [2019-12-28 02:30:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849586154] [2019-12-28 02:30:19,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:19,548 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-28 02:30:19,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849586154] [2019-12-28 02:30:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:19,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:30:19,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697004295] [2019-12-28 02:30:19,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:19,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:19,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 02:30:19,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:19,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:19,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:30:19,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:30:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:30:19,562 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-28 02:30:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:20,166 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-28 02:30:20,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:30:20,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 02:30:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:20,423 INFO L225 Difference]: With dead ends: 40214 [2019-12-28 02:30:20,424 INFO L226 Difference]: Without dead ends: 40054 [2019-12-28 02:30:20,424 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-28 02:30:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-28 02:30:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-28 02:30:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-28 02:30:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-28 02:30:23,292 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-28 02:30:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:23,295 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-28 02:30:23,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:30:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-28 02:30:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 02:30:23,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:23,310 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] [2019-12-28 02:30:23,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:23,311 INFO L82 PathProgramCache]: Analyzing trace with hash -171706089, now seen corresponding path program 1 times [2019-12-28 02:30:23,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:23,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035396109] [2019-12-28 02:30:23,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:23,476 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-28 02:30:23,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035396109] [2019-12-28 02:30:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:23,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:30:23,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386307159] [2019-12-28 02:30:23,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:23,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:23,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-28 02:30:23,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:23,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:30:23,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:30:23,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:30:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:23,535 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 7 states. [2019-12-28 02:30:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:24,608 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-28 02:30:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:30:24,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 02:30:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:24,754 INFO L225 Difference]: With dead ends: 45663 [2019-12-28 02:30:24,754 INFO L226 Difference]: Without dead ends: 45519 [2019-12-28 02:30:24,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:30:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-28 02:30:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-28 02:30:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-28 02:30:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-28 02:30:26,115 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-28 02:30:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:26,116 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-28 02:30:26,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:30:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-28 02:30:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 02:30:27,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:27,253 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] [2019-12-28 02:30:27,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1292892266, now seen corresponding path program 1 times [2019-12-28 02:30:27,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530864677] [2019-12-28 02:30:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:27,361 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-28 02:30:27,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530864677] [2019-12-28 02:30:27,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:27,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:30:27,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199190152] [2019-12-28 02:30:27,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:27,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:27,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 02:30:27,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:27,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:27,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:30:27,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:30:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:30:27,383 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-28 02:30:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:28,085 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-28 02:30:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:30:28,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 02:30:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:28,181 INFO L225 Difference]: With dead ends: 46070 [2019-12-28 02:30:28,181 INFO L226 Difference]: Without dead ends: 45830 [2019-12-28 02:30:28,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:30:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-28 02:30:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-28 02:30:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-28 02:30:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-28 02:30:29,229 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-28 02:30:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:29,230 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-28 02:30:29,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:30:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-28 02:30:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:30:29,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:29,263 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] [2019-12-28 02:30:29,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 43524005, now seen corresponding path program 1 times [2019-12-28 02:30:29,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617349278] [2019-12-28 02:30:29,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:29,324 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-28 02:30:29,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617349278] [2019-12-28 02:30:29,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:29,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:30:29,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725523359] [2019-12-28 02:30:29,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:29,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:29,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:30:29,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:29,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:29,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:30:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:30:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:30:29,351 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-28 02:30:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:29,947 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-28 02:30:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:30:29,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-28 02:30:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:30,052 INFO L225 Difference]: With dead ends: 50257 [2019-12-28 02:30:30,053 INFO L226 Difference]: Without dead ends: 50257 [2019-12-28 02:30:30,053 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-28 02:30:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-28 02:30:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-28 02:30:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-28 02:30:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-28 02:30:32,953 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-28 02:30:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:32,953 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-28 02:30:32,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:30:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-28 02:30:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:30:32,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:32,987 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-28 02:30:32,988 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash -41034466, now seen corresponding path program 1 times [2019-12-28 02:30:32,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:32,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326744351] [2019-12-28 02:30:32,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:33,082 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-28 02:30:33,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326744351] [2019-12-28 02:30:33,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:33,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:30:33,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534571793] [2019-12-28 02:30:33,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:33,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:33,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 02:30:33,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:33,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:33,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:30:33,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:30:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:33,111 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-28 02:30:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:34,213 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-28 02:30:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 02:30:34,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 02:30:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:34,354 INFO L225 Difference]: With dead ends: 55885 [2019-12-28 02:30:34,354 INFO L226 Difference]: Without dead ends: 55645 [2019-12-28 02:30:34,354 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-28 02:30:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-28 02:30:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-28 02:30:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-28 02:30:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-28 02:30:35,528 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-28 02:30:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:35,529 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-28 02:30:35,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:30:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-28 02:30:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 02:30:35,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:35,565 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] [2019-12-28 02:30:35,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash -44622651, now seen corresponding path program 1 times [2019-12-28 02:30:35,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:35,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115782604] [2019-12-28 02:30:35,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:35,643 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-28 02:30:35,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115782604] [2019-12-28 02:30:35,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:35,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:30:35,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066348671] [2019-12-28 02:30:35,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:35,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:35,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 152 transitions. [2019-12-28 02:30:35,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:35,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:30:35,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:30:35,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:30:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:30:35,703 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 8 states. [2019-12-28 02:30:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:37,409 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-28 02:30:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 02:30:37,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 02:30:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:37,528 INFO L225 Difference]: With dead ends: 55099 [2019-12-28 02:30:37,528 INFO L226 Difference]: Without dead ends: 54899 [2019-12-28 02:30:37,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-28 02:30:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-28 02:30:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-28 02:30:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-28 02:30:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-28 02:30:38,411 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-28 02:30:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:38,411 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-28 02:30:38,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:30:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-28 02:30:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:30:38,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:38,446 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-28 02:30:38,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash 500322373, now seen corresponding path program 1 times [2019-12-28 02:30:38,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:38,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017079170] [2019-12-28 02:30:38,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:38,804 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-28 02:30:38,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017079170] [2019-12-28 02:30:38,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:38,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:30:38,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317076529] [2019-12-28 02:30:38,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:38,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:38,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:30:38,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:38,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:38,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:30:38,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:30:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:30:38,832 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-28 02:30:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:39,688 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-28 02:30:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:30:39,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 02:30:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:39,831 INFO L225 Difference]: With dead ends: 65553 [2019-12-28 02:30:39,832 INFO L226 Difference]: Without dead ends: 64909 [2019-12-28 02:30:39,832 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-28 02:30:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-28 02:30:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-28 02:30:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-28 02:30:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-28 02:30:42,917 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-28 02:30:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:42,917 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-28 02:30:42,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:30:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-28 02:30:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:30:42,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:42,972 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-28 02:30:42,972 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1461936390, now seen corresponding path program 1 times [2019-12-28 02:30:42,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:42,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773656226] [2019-12-28 02:30:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:43,071 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-28 02:30:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773656226] [2019-12-28 02:30:43,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:43,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:30:43,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1861415922] [2019-12-28 02:30:43,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:43,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:43,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:30:43,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:43,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:43,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:30:43,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:30:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:43,098 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-28 02:30:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:44,389 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-28 02:30:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:30:44,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-28 02:30:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:44,572 INFO L225 Difference]: With dead ends: 83031 [2019-12-28 02:30:44,572 INFO L226 Difference]: Without dead ends: 83031 [2019-12-28 02:30:44,573 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-28 02:30:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-28 02:30:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-28 02:30:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-28 02:30:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-28 02:30:46,502 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-28 02:30:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:46,502 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-28 02:30:46,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:30:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-28 02:30:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:30:46,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:46,582 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-28 02:30:46,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1588266425, now seen corresponding path program 1 times [2019-12-28 02:30:46,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458673191] [2019-12-28 02:30:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:46,638 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-28 02:30:46,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458673191] [2019-12-28 02:30:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:30:46,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1800848410] [2019-12-28 02:30:46,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:46,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:46,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:30:46,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:46,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:46,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:30:46,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:30:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:30:46,664 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-28 02:30:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:49,135 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-28 02:30:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:30:49,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-28 02:30:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:49,255 INFO L225 Difference]: With dead ends: 54416 [2019-12-28 02:30:49,255 INFO L226 Difference]: Without dead ends: 54254 [2019-12-28 02:30:49,255 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-28 02:30:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-28 02:30:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-28 02:30:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-28 02:30:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-28 02:30:50,219 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-28 02:30:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:50,219 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-28 02:30:50,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:30:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-28 02:30:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 02:30:50,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:50,256 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] [2019-12-28 02:30:50,257 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 204738783, now seen corresponding path program 1 times [2019-12-28 02:30:50,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:50,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309822148] [2019-12-28 02:30:50,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:50,334 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-28 02:30:50,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309822148] [2019-12-28 02:30:50,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:50,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:30:50,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572863003] [2019-12-28 02:30:50,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:50,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:50,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 02:30:50,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:50,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:50,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:30:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:30:50,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:30:50,361 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 4 states. [2019-12-28 02:30:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:50,447 INFO L93 Difference]: Finished difference Result 13718 states and 43556 transitions. [2019-12-28 02:30:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:30:50,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-28 02:30:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:50,477 INFO L225 Difference]: With dead ends: 13718 [2019-12-28 02:30:50,477 INFO L226 Difference]: Without dead ends: 13240 [2019-12-28 02:30:50,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:30:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2019-12-28 02:30:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 13228. [2019-12-28 02:30:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13228 states. [2019-12-28 02:30:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13228 states to 13228 states and 42051 transitions. [2019-12-28 02:30:50,693 INFO L78 Accepts]: Start accepts. Automaton has 13228 states and 42051 transitions. Word has length 71 [2019-12-28 02:30:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:50,694 INFO L462 AbstractCegarLoop]: Abstraction has 13228 states and 42051 transitions. [2019-12-28 02:30:50,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:30:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13228 states and 42051 transitions. [2019-12-28 02:30:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 02:30:50,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:50,703 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] [2019-12-28 02:30:50,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -977177849, now seen corresponding path program 1 times [2019-12-28 02:30:50,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:50,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133862419] [2019-12-28 02:30:50,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:50,953 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-28 02:30:50,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133862419] [2019-12-28 02:30:50,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:50,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:30:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372874090] [2019-12-28 02:30:50,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:50,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:51,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 02:30:51,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:51,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:30:51,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:30:51,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:30:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:30:51,061 INFO L87 Difference]: Start difference. First operand 13228 states and 42051 transitions. Second operand 6 states. [2019-12-28 02:30:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:51,374 INFO L93 Difference]: Finished difference Result 17806 states and 55643 transitions. [2019-12-28 02:30:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:30:51,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 02:30:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:51,403 INFO L225 Difference]: With dead ends: 17806 [2019-12-28 02:30:51,403 INFO L226 Difference]: Without dead ends: 17806 [2019-12-28 02:30:51,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17806 states. [2019-12-28 02:30:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17806 to 14044. [2019-12-28 02:30:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14044 states. [2019-12-28 02:30:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14044 states to 14044 states and 44351 transitions. [2019-12-28 02:30:51,614 INFO L78 Accepts]: Start accepts. Automaton has 14044 states and 44351 transitions. Word has length 80 [2019-12-28 02:30:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:51,614 INFO L462 AbstractCegarLoop]: Abstraction has 14044 states and 44351 transitions. [2019-12-28 02:30:51,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:30:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 14044 states and 44351 transitions. [2019-12-28 02:30:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 02:30:51,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:51,624 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] [2019-12-28 02:30:51,624 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1231914394, now seen corresponding path program 1 times [2019-12-28 02:30:51,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:51,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063527762] [2019-12-28 02:30:51,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:51,710 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-28 02:30:51,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063527762] [2019-12-28 02:30:51,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:51,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:30:51,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123690629] [2019-12-28 02:30:51,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:51,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:51,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 02:30:51,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:51,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:30:51,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:30:51,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:30:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:30:51,791 INFO L87 Difference]: Start difference. First operand 14044 states and 44351 transitions. Second operand 9 states. [2019-12-28 02:30:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:52,827 INFO L93 Difference]: Finished difference Result 15895 states and 49761 transitions. [2019-12-28 02:30:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:30:52,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-28 02:30:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:52,853 INFO L225 Difference]: With dead ends: 15895 [2019-12-28 02:30:52,853 INFO L226 Difference]: Without dead ends: 15847 [2019-12-28 02:30:52,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-28 02:30:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states. [2019-12-28 02:30:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 14137. [2019-12-28 02:30:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14137 states. [2019-12-28 02:30:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 44776 transitions. [2019-12-28 02:30:53,057 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 44776 transitions. Word has length 80 [2019-12-28 02:30:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:53,057 INFO L462 AbstractCegarLoop]: Abstraction has 14137 states and 44776 transitions. [2019-12-28 02:30:53,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:30:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 44776 transitions. [2019-12-28 02:30:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:30:53,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:53,069 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] [2019-12-28 02:30:53,069 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash 631897787, now seen corresponding path program 1 times [2019-12-28 02:30:53,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:53,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512632518] [2019-12-28 02:30:53,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:53,165 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-28 02:30:53,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512632518] [2019-12-28 02:30:53,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:53,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:30:53,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131837347] [2019-12-28 02:30:53,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:53,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:53,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 02:30:53,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:53,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:53,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:30:53,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:30:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:30:53,211 INFO L87 Difference]: Start difference. First operand 14137 states and 44776 transitions. Second operand 8 states. [2019-12-28 02:30:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:55,880 INFO L93 Difference]: Finished difference Result 41333 states and 125772 transitions. [2019-12-28 02:30:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 02:30:55,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-28 02:30:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:55,941 INFO L225 Difference]: With dead ends: 41333 [2019-12-28 02:30:55,941 INFO L226 Difference]: Without dead ends: 40937 [2019-12-28 02:30:55,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-28 02:30:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40937 states. [2019-12-28 02:30:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40937 to 23564. [2019-12-28 02:30:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23564 states. [2019-12-28 02:30:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23564 states to 23564 states and 73197 transitions. [2019-12-28 02:30:56,365 INFO L78 Accepts]: Start accepts. Automaton has 23564 states and 73197 transitions. Word has length 83 [2019-12-28 02:30:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:56,365 INFO L462 AbstractCegarLoop]: Abstraction has 23564 states and 73197 transitions. [2019-12-28 02:30:56,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:30:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23564 states and 73197 transitions. [2019-12-28 02:30:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:30:56,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:56,385 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] [2019-12-28 02:30:56,385 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1456691011, now seen corresponding path program 1 times [2019-12-28 02:30:56,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:56,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130902361] [2019-12-28 02:30:56,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:56,488 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-28 02:30:56,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130902361] [2019-12-28 02:30:56,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:56,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:30:56,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251372411] [2019-12-28 02:30:56,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:56,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:56,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 02:30:56,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:56,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:30:56,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:30:56,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:56,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:30:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:30:56,536 INFO L87 Difference]: Start difference. First operand 23564 states and 73197 transitions. Second operand 6 states. [2019-12-28 02:30:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:57,077 INFO L93 Difference]: Finished difference Result 24462 states and 75535 transitions. [2019-12-28 02:30:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:30:57,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 02:30:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:57,119 INFO L225 Difference]: With dead ends: 24462 [2019-12-28 02:30:57,119 INFO L226 Difference]: Without dead ends: 24462 [2019-12-28 02:30:57,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-28 02:30:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24462 states. [2019-12-28 02:30:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24462 to 23161. [2019-12-28 02:30:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23161 states. [2019-12-28 02:30:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23161 states to 23161 states and 71815 transitions. [2019-12-28 02:30:57,434 INFO L78 Accepts]: Start accepts. Automaton has 23161 states and 71815 transitions. Word has length 83 [2019-12-28 02:30:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:57,434 INFO L462 AbstractCegarLoop]: Abstraction has 23161 states and 71815 transitions. [2019-12-28 02:30:57,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:30:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23161 states and 71815 transitions. [2019-12-28 02:30:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:30:57,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:57,453 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] [2019-12-28 02:30:57,454 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash 902615998, now seen corresponding path program 1 times [2019-12-28 02:30:57,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:57,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087149207] [2019-12-28 02:30:57,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:57,585 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-28 02:30:57,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087149207] [2019-12-28 02:30:57,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:57,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:30:57,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86985808] [2019-12-28 02:30:57,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:57,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:57,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 02:30:57,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:57,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:30:57,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:30:57,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:30:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:57,628 INFO L87 Difference]: Start difference. First operand 23161 states and 71815 transitions. Second operand 7 states. [2019-12-28 02:30:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:58,359 INFO L93 Difference]: Finished difference Result 24549 states and 75617 transitions. [2019-12-28 02:30:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:30:58,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 02:30:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:58,424 INFO L225 Difference]: With dead ends: 24549 [2019-12-28 02:30:58,424 INFO L226 Difference]: Without dead ends: 24549 [2019-12-28 02:30:58,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:30:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24549 states. [2019-12-28 02:30:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24549 to 23487. [2019-12-28 02:30:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23487 states. [2019-12-28 02:30:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23487 states to 23487 states and 72627 transitions. [2019-12-28 02:30:59,243 INFO L78 Accepts]: Start accepts. Automaton has 23487 states and 72627 transitions. Word has length 83 [2019-12-28 02:30:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:59,243 INFO L462 AbstractCegarLoop]: Abstraction has 23487 states and 72627 transitions. [2019-12-28 02:30:59,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:30:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 23487 states and 72627 transitions. [2019-12-28 02:30:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:30:59,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:59,272 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] [2019-12-28 02:30:59,272 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:59,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1232381759, now seen corresponding path program 1 times [2019-12-28 02:30:59,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:59,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107878635] [2019-12-28 02:30:59,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:59,327 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-28 02:30:59,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107878635] [2019-12-28 02:30:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:30:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [211499546] [2019-12-28 02:30:59,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:59,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:59,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 02:30:59,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:59,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:30:59,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:30:59,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:30:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:30:59,378 INFO L87 Difference]: Start difference. First operand 23487 states and 72627 transitions. Second operand 3 states. [2019-12-28 02:30:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:30:59,468 INFO L93 Difference]: Finished difference Result 16769 states and 51473 transitions. [2019-12-28 02:30:59,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:30:59,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-28 02:30:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:30:59,500 INFO L225 Difference]: With dead ends: 16769 [2019-12-28 02:30:59,501 INFO L226 Difference]: Without dead ends: 16769 [2019-12-28 02:30:59,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:30:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16769 states. [2019-12-28 02:30:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16769 to 16464. [2019-12-28 02:30:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16464 states. [2019-12-28 02:30:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16464 states to 16464 states and 50581 transitions. [2019-12-28 02:30:59,732 INFO L78 Accepts]: Start accepts. Automaton has 16464 states and 50581 transitions. Word has length 83 [2019-12-28 02:30:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:30:59,732 INFO L462 AbstractCegarLoop]: Abstraction has 16464 states and 50581 transitions. [2019-12-28 02:30:59,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:30:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16464 states and 50581 transitions. [2019-12-28 02:30:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 02:30:59,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:30:59,746 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] [2019-12-28 02:30:59,746 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:30:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:30:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1707454838, now seen corresponding path program 1 times [2019-12-28 02:30:59,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:30:59,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630067209] [2019-12-28 02:30:59,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:30:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:30:59,862 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-28 02:30:59,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630067209] [2019-12-28 02:30:59,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:30:59,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:30:59,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793714064] [2019-12-28 02:30:59,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:30:59,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:30:59,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 188 transitions. [2019-12-28 02:30:59,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:30:59,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:30:59,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:30:59,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:30:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:30:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:30:59,971 INFO L87 Difference]: Start difference. First operand 16464 states and 50581 transitions. Second operand 7 states. [2019-12-28 02:31:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:00,137 INFO L93 Difference]: Finished difference Result 16430 states and 50511 transitions. [2019-12-28 02:31:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:31:00,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-28 02:31:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:00,161 INFO L225 Difference]: With dead ends: 16430 [2019-12-28 02:31:00,161 INFO L226 Difference]: Without dead ends: 16430 [2019-12-28 02:31:00,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16430 states. [2019-12-28 02:31:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16430 to 16430. [2019-12-28 02:31:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-12-28 02:31:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 50511 transitions. [2019-12-28 02:31:00,379 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 50511 transitions. Word has length 84 [2019-12-28 02:31:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:00,379 INFO L462 AbstractCegarLoop]: Abstraction has 16430 states and 50511 transitions. [2019-12-28 02:31:00,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 50511 transitions. [2019-12-28 02:31:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 02:31:00,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:00,394 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] [2019-12-28 02:31:00,394 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1377689077, now seen corresponding path program 1 times [2019-12-28 02:31:00,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:00,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377948158] [2019-12-28 02:31:00,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:00,463 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-28 02:31:00,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377948158] [2019-12-28 02:31:00,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:00,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:31:00,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131737522] [2019-12-28 02:31:00,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:00,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:00,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 188 transitions. [2019-12-28 02:31:00,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:00,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:00,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:00,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:00,542 INFO L87 Difference]: Start difference. First operand 16430 states and 50511 transitions. Second operand 6 states. [2019-12-28 02:31:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:00,594 INFO L93 Difference]: Finished difference Result 2714 states and 6663 transitions. [2019-12-28 02:31:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:31:00,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-28 02:31:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:00,599 INFO L225 Difference]: With dead ends: 2714 [2019-12-28 02:31:00,599 INFO L226 Difference]: Without dead ends: 2328 [2019-12-28 02:31:00,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-12-28 02:31:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2158. [2019-12-28 02:31:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-12-28 02:31:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 5289 transitions. [2019-12-28 02:31:00,632 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 5289 transitions. Word has length 84 [2019-12-28 02:31:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:00,633 INFO L462 AbstractCegarLoop]: Abstraction has 2158 states and 5289 transitions. [2019-12-28 02:31:00,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 5289 transitions. [2019-12-28 02:31:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:00,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:00,636 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, 1] [2019-12-28 02:31:00,636 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1631061393, now seen corresponding path program 1 times [2019-12-28 02:31:00,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:00,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445647075] [2019-12-28 02:31:00,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:00,779 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-28 02:31:00,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445647075] [2019-12-28 02:31:00,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:00,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:00,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474739774] [2019-12-28 02:31:00,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:00,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:00,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 187 transitions. [2019-12-28 02:31:00,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:00,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 02:31:00,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:31:00,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:31:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:00,902 INFO L87 Difference]: Start difference. First operand 2158 states and 5289 transitions. Second operand 8 states. [2019-12-28 02:31:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:01,125 INFO L93 Difference]: Finished difference Result 2134 states and 5233 transitions. [2019-12-28 02:31:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:31:01,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 02:31:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:01,130 INFO L225 Difference]: With dead ends: 2134 [2019-12-28 02:31:01,130 INFO L226 Difference]: Without dead ends: 2134 [2019-12-28 02:31:01,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:31:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2019-12-28 02:31:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2042. [2019-12-28 02:31:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-12-28 02:31:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5002 transitions. [2019-12-28 02:31:01,151 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 5002 transitions. Word has length 97 [2019-12-28 02:31:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:01,151 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 5002 transitions. [2019-12-28 02:31:01,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:31:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 5002 transitions. [2019-12-28 02:31:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:01,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:01,153 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, 1] [2019-12-28 02:31:01,153 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1270917992, now seen corresponding path program 1 times [2019-12-28 02:31:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:01,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064389130] [2019-12-28 02:31:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:01,218 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-28 02:31:01,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064389130] [2019-12-28 02:31:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:01,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24485397] [2019-12-28 02:31:01,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:01,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:01,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:01,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:01,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:31:01,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:31:01,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:31:01,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:01,516 INFO L87 Difference]: Start difference. First operand 2042 states and 5002 transitions. Second operand 8 states. [2019-12-28 02:31:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:02,697 INFO L93 Difference]: Finished difference Result 4548 states and 11087 transitions. [2019-12-28 02:31:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 02:31:02,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 02:31:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:02,704 INFO L225 Difference]: With dead ends: 4548 [2019-12-28 02:31:02,704 INFO L226 Difference]: Without dead ends: 4548 [2019-12-28 02:31:02,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:31:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2019-12-28 02:31:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 2125. [2019-12-28 02:31:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-28 02:31:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5187 transitions. [2019-12-28 02:31:02,735 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5187 transitions. Word has length 97 [2019-12-28 02:31:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:02,735 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 5187 transitions. [2019-12-28 02:31:02,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:31:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5187 transitions. [2019-12-28 02:31:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:02,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:02,737 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, 1] [2019-12-28 02:31:02,737 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2101365721, now seen corresponding path program 1 times [2019-12-28 02:31:02,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:02,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004704609] [2019-12-28 02:31:02,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:02,862 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-28 02:31:02,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004704609] [2019-12-28 02:31:02,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:02,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:02,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621665447] [2019-12-28 02:31:02,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:02,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:02,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:02,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:02,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:31:02,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:02,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:02,976 INFO L87 Difference]: Start difference. First operand 2125 states and 5187 transitions. Second operand 7 states. [2019-12-28 02:31:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:03,163 INFO L93 Difference]: Finished difference Result 2351 states and 5588 transitions. [2019-12-28 02:31:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:31:03,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 02:31:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:03,167 INFO L225 Difference]: With dead ends: 2351 [2019-12-28 02:31:03,167 INFO L226 Difference]: Without dead ends: 2306 [2019-12-28 02:31:03,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-28 02:31:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2184. [2019-12-28 02:31:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-28 02:31:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5252 transitions. [2019-12-28 02:31:03,189 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5252 transitions. Word has length 97 [2019-12-28 02:31:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:03,189 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 5252 transitions. [2019-12-28 02:31:03,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5252 transitions. [2019-12-28 02:31:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:03,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:03,191 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, 1] [2019-12-28 02:31:03,192 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash 165705434, now seen corresponding path program 1 times [2019-12-28 02:31:03,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:03,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349917208] [2019-12-28 02:31:03,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:03,311 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-28 02:31:03,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349917208] [2019-12-28 02:31:03,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:03,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:03,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1491651896] [2019-12-28 02:31:03,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:03,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:03,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:03,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:03,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:31:03,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:31:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:31:03,486 INFO L87 Difference]: Start difference. First operand 2184 states and 5252 transitions. Second operand 9 states. [2019-12-28 02:31:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:04,657 INFO L93 Difference]: Finished difference Result 5315 states and 12486 transitions. [2019-12-28 02:31:04,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 02:31:04,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 02:31:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:04,665 INFO L225 Difference]: With dead ends: 5315 [2019-12-28 02:31:04,665 INFO L226 Difference]: Without dead ends: 5315 [2019-12-28 02:31:04,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2019-12-28 02:31:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2019-12-28 02:31:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 2485. [2019-12-28 02:31:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-12-28 02:31:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 5894 transitions. [2019-12-28 02:31:04,707 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 5894 transitions. Word has length 97 [2019-12-28 02:31:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:04,707 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 5894 transitions. [2019-12-28 02:31:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:31:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 5894 transitions. [2019-12-28 02:31:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:04,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:04,711 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, 1] [2019-12-28 02:31:04,711 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash 495471195, now seen corresponding path program 1 times [2019-12-28 02:31:04,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:04,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035785345] [2019-12-28 02:31:04,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:04,770 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-28 02:31:04,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035785345] [2019-12-28 02:31:04,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:04,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:04,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [942310871] [2019-12-28 02:31:04,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:04,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:04,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:04,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:04,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:04,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:31:04,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:04,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:31:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:31:04,881 INFO L87 Difference]: Start difference. First operand 2485 states and 5894 transitions. Second operand 5 states. [2019-12-28 02:31:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:04,999 INFO L93 Difference]: Finished difference Result 2296 states and 5390 transitions. [2019-12-28 02:31:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:31:05,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-28 02:31:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:05,004 INFO L225 Difference]: With dead ends: 2296 [2019-12-28 02:31:05,004 INFO L226 Difference]: Without dead ends: 2296 [2019-12-28 02:31:05,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-12-28 02:31:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2154. [2019-12-28 02:31:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-28 02:31:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 5077 transitions. [2019-12-28 02:31:05,042 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 5077 transitions. Word has length 97 [2019-12-28 02:31:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:05,043 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 5077 transitions. [2019-12-28 02:31:05,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:31:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 5077 transitions. [2019-12-28 02:31:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:05,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:05,047 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, 1] [2019-12-28 02:31:05,047 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -553018629, now seen corresponding path program 1 times [2019-12-28 02:31:05,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:05,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146047792] [2019-12-28 02:31:05,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:05,135 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-28 02:31:05,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146047792] [2019-12-28 02:31:05,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:05,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:31:05,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124494148] [2019-12-28 02:31:05,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:05,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:05,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:05,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:05,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:05,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:05,255 INFO L87 Difference]: Start difference. First operand 2154 states and 5077 transitions. Second operand 6 states. [2019-12-28 02:31:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:05,467 INFO L93 Difference]: Finished difference Result 2406 states and 5656 transitions. [2019-12-28 02:31:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:31:05,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-28 02:31:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:05,471 INFO L225 Difference]: With dead ends: 2406 [2019-12-28 02:31:05,471 INFO L226 Difference]: Without dead ends: 2388 [2019-12-28 02:31:05,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-28 02:31:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2181. [2019-12-28 02:31:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2019-12-28 02:31:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5131 transitions. [2019-12-28 02:31:05,496 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5131 transitions. Word has length 97 [2019-12-28 02:31:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:05,496 INFO L462 AbstractCegarLoop]: Abstraction has 2181 states and 5131 transitions. [2019-12-28 02:31:05,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5131 transitions. [2019-12-28 02:31:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:05,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:05,498 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, 1] [2019-12-28 02:31:05,498 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash 691745852, now seen corresponding path program 1 times [2019-12-28 02:31:05,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:05,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81197102] [2019-12-28 02:31:05,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:05,575 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-28 02:31:05,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81197102] [2019-12-28 02:31:05,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:05,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:31:05,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750126044] [2019-12-28 02:31:05,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:05,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:05,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:05,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:05,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:31:05,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:31:05,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:31:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:05,764 INFO L87 Difference]: Start difference. First operand 2181 states and 5131 transitions. Second operand 8 states. [2019-12-28 02:31:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:06,329 INFO L93 Difference]: Finished difference Result 3379 states and 7967 transitions. [2019-12-28 02:31:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:31:06,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 02:31:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:06,335 INFO L225 Difference]: With dead ends: 3379 [2019-12-28 02:31:06,335 INFO L226 Difference]: Without dead ends: 3379 [2019-12-28 02:31:06,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:31:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-12-28 02:31:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 1887. [2019-12-28 02:31:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-12-28 02:31:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 4447 transitions. [2019-12-28 02:31:06,373 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 4447 transitions. Word has length 97 [2019-12-28 02:31:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:06,374 INFO L462 AbstractCegarLoop]: Abstraction has 1887 states and 4447 transitions. [2019-12-28 02:31:06,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:31:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 4447 transitions. [2019-12-28 02:31:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:06,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:06,377 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, 1] [2019-12-28 02:31:06,377 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash -821367206, now seen corresponding path program 1 times [2019-12-28 02:31:06,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:06,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639111127] [2019-12-28 02:31:06,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:06,476 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-28 02:31:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639111127] [2019-12-28 02:31:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191680764] [2019-12-28 02:31:06,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:06,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:06,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:06,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:06,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:31:06,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:06,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:06,593 INFO L87 Difference]: Start difference. First operand 1887 states and 4447 transitions. Second operand 7 states. [2019-12-28 02:31:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:06,785 INFO L93 Difference]: Finished difference Result 2054 states and 4766 transitions. [2019-12-28 02:31:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:31:06,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 02:31:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:06,791 INFO L225 Difference]: With dead ends: 2054 [2019-12-28 02:31:06,791 INFO L226 Difference]: Without dead ends: 2054 [2019-12-28 02:31:06,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:31:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-12-28 02:31:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1939. [2019-12-28 02:31:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-28 02:31:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4547 transitions. [2019-12-28 02:31:06,810 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4547 transitions. Word has length 97 [2019-12-28 02:31:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:06,811 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4547 transitions. [2019-12-28 02:31:06,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4547 transitions. [2019-12-28 02:31:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:06,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:06,812 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, 1] [2019-12-28 02:31:06,813 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -491601445, now seen corresponding path program 1 times [2019-12-28 02:31:06,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:06,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210598749] [2019-12-28 02:31:06,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:06,953 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-28 02:31:06,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210598749] [2019-12-28 02:31:06,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:06,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:31:06,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339761960] [2019-12-28 02:31:06,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:06,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:07,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:31:07,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:07,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:07,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:31:07,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:31:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:31:07,034 INFO L87 Difference]: Start difference. First operand 1939 states and 4547 transitions. Second operand 9 states. [2019-12-28 02:31:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:07,309 INFO L93 Difference]: Finished difference Result 3285 states and 7781 transitions. [2019-12-28 02:31:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:31:07,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 02:31:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:07,312 INFO L225 Difference]: With dead ends: 3285 [2019-12-28 02:31:07,312 INFO L226 Difference]: Without dead ends: 1428 [2019-12-28 02:31:07,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:31:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-28 02:31:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-28 02:31:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-28 02:31:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-28 02:31:07,327 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-28 02:31:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:07,327 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-28 02:31:07,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:31:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-28 02:31:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:31:07,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:07,328 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, 1] [2019-12-28 02:31:07,329 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:07,329 INFO L82 PathProgramCache]: Analyzing trace with hash 530847507, now seen corresponding path program 2 times [2019-12-28 02:31:07,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:07,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093790497] [2019-12-28 02:31:07,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:31:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:31:07,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:31:07,412 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:31:07,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:31:07 BasicIcfg [2019-12-28 02:31:07,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:31:07,635 INFO L168 Benchmark]: Toolchain (without parser) took 59006.08 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,636 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.92 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 157.2 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.50 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,637 INFO L168 Benchmark]: Boogie Preprocessor took 37.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,638 INFO L168 Benchmark]: RCFGBuilder took 840.00 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 107.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,638 INFO L168 Benchmark]: TraceAbstraction took 57289.18 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 974.6 MB. Max. memory is 7.1 GB. [2019-12-28 02:31:07,647 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.92 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 157.2 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.50 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.00 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 107.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57289.18 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 974.6 MB. 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] [L720] 0 int z = 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, z=0] [L721] 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, z=0] [L722] 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, z=0] [L788] 0 pthread_t t1091; 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, z=0] [L789] FCALL, FORK 0 pthread_create(&t1091, ((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, z=0] [L790] 0 pthread_t t1092; 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, z=0] [L791] FCALL, FORK 0 pthread_create(&t1092, ((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, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 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, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=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, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=1] [L732] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=1] [L732] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L732] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L732] 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) [L733] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=1] [L734] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L734] 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 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 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 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=1] [L766] 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) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L768] 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 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L797] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L797] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L797] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L797] 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) [L798] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L799] 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 [L800] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1] [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] [L808] 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=0, 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=1, z=1] [L808] 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) [L809] 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=0, 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=1, z=1] [L809] 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)) [L810] 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=0, 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=1, z=1] [L810] 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)) [L811] 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=0, 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=1, z=1] [L811] 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)) [L812] 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=0, 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=1, z=1] [L812] 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)) [L813] 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=0, 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=1, z=1] [L813] 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)) [L814] 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=0, 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=1, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7694 SDtfs, 11123 SDslu, 18268 SDs, 0 SdLazy, 9263 SolverSat, 698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 147 SyntacticMatches, 21 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76080occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 99570 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2356 NumberOfCodeBlocks, 2356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2230 ConstructedInterpolants, 0 QuantifiedInterpolants, 450262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...