/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/mix000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:47:46,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:47:46,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:47:46,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:47:46,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:47:46,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:47:46,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:47:46,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:47:46,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:47:46,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:47:46,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:47:46,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:47:46,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:47:46,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:47:46,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:47:46,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:47:46,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:47:46,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:47:46,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:47:46,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:47:46,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:47:46,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:47:46,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:47:46,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:47:46,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:47:46,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:47:46,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:47:46,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:47:46,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:47:46,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:47:46,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:47:46,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:47:46,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:47:46,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:47:46,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:47:46,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:47:46,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:47:46,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:47:46,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:47:46,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:47:46,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:47:46,181 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-27 23:47:46,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:47:46,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:47:46,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:47:46,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:47:46,199 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:47:46,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:47:46,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:47:46,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:47:46,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:47:46,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:47:46,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:47:46,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:47:46,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:47:46,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:47:46,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:47:46,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:47:46,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:47:46,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:47:46,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:47:46,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:47:46,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:47:46,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:47:46,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:47:46,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:47:46,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:47:46,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:47:46,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:47:46,205 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:47:46,205 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:47:46,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:47:46,206 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:47:46,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:47:46,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:47:46,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:47:46,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:47:46,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:47:46,522 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:47:46,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 23:47:46,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de1509d8/45b9f41fd4634691987a97413d242e3b/FLAG25cdea06a [2019-12-27 23:47:47,200 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:47:47,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 23:47:47,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de1509d8/45b9f41fd4634691987a97413d242e3b/FLAG25cdea06a [2019-12-27 23:47:47,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de1509d8/45b9f41fd4634691987a97413d242e3b [2019-12-27 23:47:47,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:47:47,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:47:47,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:47:47,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:47:47,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:47:47,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:47:47" (1/1) ... [2019-12-27 23:47:47,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a83c622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:47, skipping insertion in model container [2019-12-27 23:47:47,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:47:47" (1/1) ... [2019-12-27 23:47:47,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:47:47,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:47:48,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:47:48,158 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:47:48,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:47:48,316 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:47:48,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48 WrapperNode [2019-12-27 23:47:48,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:47:48,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:47:48,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:47:48,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:47:48,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:47:48,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:47:48,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:47:48,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:47:48,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (1/1) ... [2019-12-27 23:47:48,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:47:48,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:47:48,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:47:48,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:47:48,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (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-27 23:47:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:47:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:47:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:47:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:47:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:47:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:47:48,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:47:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:47:48,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:47:48,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:47:48,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:47:48,529 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:47:49,393 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:47:49,394 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:47:49,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:47:49 BoogieIcfgContainer [2019-12-27 23:47:49,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:47:49,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:47:49,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:47:49,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:47:49,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:47:47" (1/3) ... [2019-12-27 23:47:49,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7620722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:47:49, skipping insertion in model container [2019-12-27 23:47:49,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:47:48" (2/3) ... [2019-12-27 23:47:49,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7620722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:47:49, skipping insertion in model container [2019-12-27 23:47:49,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:47:49" (3/3) ... [2019-12-27 23:47:49,405 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_pso.opt.i [2019-12-27 23:47:49,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:47:49,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:47:49,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:47:49,426 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:47:49,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:47:49,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:47:49,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:47:49,638 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:47:49,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:47:49,639 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:47:49,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:47:49,639 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:47:49,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:47:49,639 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:47:49,657 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 179 places, 228 transitions [2019-12-27 23:47:57,826 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80073 states. [2019-12-27 23:47:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 80073 states. [2019-12-27 23:47:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:47:57,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:47:57,838 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] [2019-12-27 23:47:57,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:47:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:47:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash -37838152, now seen corresponding path program 1 times [2019-12-27 23:47:57,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:47:57,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689264800] [2019-12-27 23:47:57,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:47:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:47:58,173 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-27 23:47:58,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689264800] [2019-12-27 23:47:58,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:47:58,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:47:58,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138225626] [2019-12-27 23:47:58,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:47:58,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:47:58,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-27 23:47:58,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:47:58,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:47:58,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:47:58,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:47:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:47:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:47:58,319 INFO L87 Difference]: Start difference. First operand 80073 states. Second operand 4 states. [2019-12-27 23:48:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:00,691 INFO L93 Difference]: Finished difference Result 80713 states and 324638 transitions. [2019-12-27 23:48:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:48:00,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 23:48:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:01,132 INFO L225 Difference]: With dead ends: 80713 [2019-12-27 23:48:01,132 INFO L226 Difference]: Without dead ends: 59001 [2019-12-27 23:48:01,134 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-27 23:48:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59001 states. [2019-12-27 23:48:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59001 to 59001. [2019-12-27 23:48:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-12-27 23:48:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 240126 transitions. [2019-12-27 23:48:06,045 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 240126 transitions. Word has length 40 [2019-12-27 23:48:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:06,045 INFO L462 AbstractCegarLoop]: Abstraction has 59001 states and 240126 transitions. [2019-12-27 23:48:06,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:48:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 240126 transitions. [2019-12-27 23:48:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:48:06,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:06,058 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] [2019-12-27 23:48:06,061 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1935034616, now seen corresponding path program 1 times [2019-12-27 23:48:06,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:06,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414756564] [2019-12-27 23:48:06,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:06,240 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-27 23:48:06,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414756564] [2019-12-27 23:48:06,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:06,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:48:06,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789084369] [2019-12-27 23:48:06,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:06,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:06,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 23:48:06,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:06,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:48:06,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:48:06,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:48:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:48:06,257 INFO L87 Difference]: Start difference. First operand 59001 states and 240126 transitions. Second operand 5 states. [2019-12-27 23:48:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:09,608 INFO L93 Difference]: Finished difference Result 95595 states and 363717 transitions. [2019-12-27 23:48:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:48:09,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 23:48:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:10,080 INFO L225 Difference]: With dead ends: 95595 [2019-12-27 23:48:10,080 INFO L226 Difference]: Without dead ends: 95043 [2019-12-27 23:48:10,081 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-27 23:48:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95043 states. [2019-12-27 23:48:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95043 to 93165. [2019-12-27 23:48:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93165 states. [2019-12-27 23:48:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93165 states to 93165 states and 356303 transitions. [2019-12-27 23:48:14,901 INFO L78 Accepts]: Start accepts. Automaton has 93165 states and 356303 transitions. Word has length 48 [2019-12-27 23:48:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:14,902 INFO L462 AbstractCegarLoop]: Abstraction has 93165 states and 356303 transitions. [2019-12-27 23:48:14,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:48:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93165 states and 356303 transitions. [2019-12-27 23:48:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 23:48:14,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:14,909 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] [2019-12-27 23:48:14,909 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1649757835, now seen corresponding path program 1 times [2019-12-27 23:48:14,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:14,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172953272] [2019-12-27 23:48:14,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:14,995 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-27 23:48:14,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172953272] [2019-12-27 23:48:14,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:14,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:48:14,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296314450] [2019-12-27 23:48:14,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:15,004 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:15,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-27 23:48:15,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:15,088 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:48:15,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:48:15,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:15,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:48:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:48:15,090 INFO L87 Difference]: Start difference. First operand 93165 states and 356303 transitions. Second operand 6 states. [2019-12-27 23:48:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:19,703 INFO L93 Difference]: Finished difference Result 118509 states and 442884 transitions. [2019-12-27 23:48:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:48:19,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-27 23:48:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:20,234 INFO L225 Difference]: With dead ends: 118509 [2019-12-27 23:48:20,235 INFO L226 Difference]: Without dead ends: 118061 [2019-12-27 23:48:20,235 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-27 23:48:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118061 states. [2019-12-27 23:48:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118061 to 104154. [2019-12-27 23:48:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104154 states. [2019-12-27 23:48:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104154 states to 104154 states and 394237 transitions. [2019-12-27 23:48:24,755 INFO L78 Accepts]: Start accepts. Automaton has 104154 states and 394237 transitions. Word has length 49 [2019-12-27 23:48:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:24,755 INFO L462 AbstractCegarLoop]: Abstraction has 104154 states and 394237 transitions. [2019-12-27 23:48:24,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:48:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 104154 states and 394237 transitions. [2019-12-27 23:48:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 23:48:24,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:24,765 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] [2019-12-27 23:48:24,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1457879985, now seen corresponding path program 1 times [2019-12-27 23:48:24,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396918733] [2019-12-27 23:48:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:24,820 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-27 23:48:24,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396918733] [2019-12-27 23:48:24,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:24,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:48:24,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123758493] [2019-12-27 23:48:24,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:24,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:24,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-27 23:48:24,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:24,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:48:24,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:48:24,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:48:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:48:24,871 INFO L87 Difference]: Start difference. First operand 104154 states and 394237 transitions. Second operand 5 states. [2019-12-27 23:48:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:25,752 INFO L93 Difference]: Finished difference Result 170912 states and 627059 transitions. [2019-12-27 23:48:25,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:48:25,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 23:48:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:26,247 INFO L225 Difference]: With dead ends: 170912 [2019-12-27 23:48:26,247 INFO L226 Difference]: Without dead ends: 170912 [2019-12-27 23:48:26,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:48:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170912 states. [2019-12-27 23:48:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170912 to 157190. [2019-12-27 23:48:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157190 states. [2019-12-27 23:48:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157190 states to 157190 states and 581291 transitions. [2019-12-27 23:48:35,655 INFO L78 Accepts]: Start accepts. Automaton has 157190 states and 581291 transitions. Word has length 51 [2019-12-27 23:48:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:35,655 INFO L462 AbstractCegarLoop]: Abstraction has 157190 states and 581291 transitions. [2019-12-27 23:48:35,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:48:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 157190 states and 581291 transitions. [2019-12-27 23:48:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:48:35,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:35,687 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] [2019-12-27 23:48:35,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash -98676228, now seen corresponding path program 1 times [2019-12-27 23:48:35,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:35,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130391656] [2019-12-27 23:48:35,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:35,774 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-27 23:48:35,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130391656] [2019-12-27 23:48:35,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:35,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:48:35,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323817925] [2019-12-27 23:48:35,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:35,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:35,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-27 23:48:35,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:35,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:48:35,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:48:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:48:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:48:35,846 INFO L87 Difference]: Start difference. First operand 157190 states and 581291 transitions. Second operand 8 states. [2019-12-27 23:48:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:42,428 INFO L93 Difference]: Finished difference Result 212574 states and 766173 transitions. [2019-12-27 23:48:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:48:42,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 23:48:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:42,986 INFO L225 Difference]: With dead ends: 212574 [2019-12-27 23:48:42,986 INFO L226 Difference]: Without dead ends: 212054 [2019-12-27 23:48:42,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:48:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212054 states. [2019-12-27 23:48:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212054 to 157972. [2019-12-27 23:48:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157972 states. [2019-12-27 23:48:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157972 states to 157972 states and 584228 transitions. [2019-12-27 23:48:49,145 INFO L78 Accepts]: Start accepts. Automaton has 157972 states and 584228 transitions. Word has length 55 [2019-12-27 23:48:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:48:49,146 INFO L462 AbstractCegarLoop]: Abstraction has 157972 states and 584228 transitions. [2019-12-27 23:48:49,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:48:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 157972 states and 584228 transitions. [2019-12-27 23:48:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:48:49,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:48:49,169 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] [2019-12-27 23:48:49,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:48:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:48:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1815293041, now seen corresponding path program 1 times [2019-12-27 23:48:49,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:48:49,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628551590] [2019-12-27 23:48:49,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:48:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:48:49,325 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-27 23:48:49,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628551590] [2019-12-27 23:48:49,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:48:49,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:48:49,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116505533] [2019-12-27 23:48:49,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:48:49,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:48:49,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-27 23:48:49,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:48:49,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:48:49,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:48:49,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:48:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:48:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:48:49,370 INFO L87 Difference]: Start difference. First operand 157972 states and 584228 transitions. Second operand 8 states. [2019-12-27 23:48:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:48:51,243 INFO L93 Difference]: Finished difference Result 208199 states and 766452 transitions. [2019-12-27 23:48:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:48:51,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 23:48:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:48:57,874 INFO L225 Difference]: With dead ends: 208199 [2019-12-27 23:48:57,874 INFO L226 Difference]: Without dead ends: 208199 [2019-12-27 23:48:57,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:48:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208199 states. [2019-12-27 23:49:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208199 to 193995. [2019-12-27 23:49:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193995 states. [2019-12-27 23:49:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193995 states to 193995 states and 714236 transitions. [2019-12-27 23:49:04,026 INFO L78 Accepts]: Start accepts. Automaton has 193995 states and 714236 transitions. Word has length 55 [2019-12-27 23:49:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:04,026 INFO L462 AbstractCegarLoop]: Abstraction has 193995 states and 714236 transitions. [2019-12-27 23:49:04,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:49:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 193995 states and 714236 transitions. [2019-12-27 23:49:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:49:04,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:04,051 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] [2019-12-27 23:49:04,051 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash 682722896, now seen corresponding path program 1 times [2019-12-27 23:49:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:04,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457837006] [2019-12-27 23:49:04,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:04,177 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-27 23:49:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457837006] [2019-12-27 23:49:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947678706] [2019-12-27 23:49:04,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:04,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:04,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-27 23:49:04,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:04,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:49:04,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:49:04,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:04,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:49:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:49:04,216 INFO L87 Difference]: Start difference. First operand 193995 states and 714236 transitions. Second operand 9 states. [2019-12-27 23:49:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:12,043 INFO L93 Difference]: Finished difference Result 277138 states and 986576 transitions. [2019-12-27 23:49:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:49:12,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 23:49:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:12,769 INFO L225 Difference]: With dead ends: 277138 [2019-12-27 23:49:12,769 INFO L226 Difference]: Without dead ends: 277138 [2019-12-27 23:49:12,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:49:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277138 states. [2019-12-27 23:49:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277138 to 222094. [2019-12-27 23:49:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222094 states. [2019-12-27 23:49:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222094 states to 222094 states and 805380 transitions. [2019-12-27 23:49:21,237 INFO L78 Accepts]: Start accepts. Automaton has 222094 states and 805380 transitions. Word has length 55 [2019-12-27 23:49:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:21,237 INFO L462 AbstractCegarLoop]: Abstraction has 222094 states and 805380 transitions. [2019-12-27 23:49:21,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:49:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 222094 states and 805380 transitions. [2019-12-27 23:49:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:49:21,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:21,260 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] [2019-12-27 23:49:21,260 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1570226577, now seen corresponding path program 1 times [2019-12-27 23:49:21,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:21,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670425527] [2019-12-27 23:49:21,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:21,329 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-27 23:49:21,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670425527] [2019-12-27 23:49:21,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:21,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:49:21,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564238606] [2019-12-27 23:49:21,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:21,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:21,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-27 23:49:21,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:21,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:21,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:49:21,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:49:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:49:21,343 INFO L87 Difference]: Start difference. First operand 222094 states and 805380 transitions. Second operand 3 states. [2019-12-27 23:49:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:28,618 INFO L93 Difference]: Finished difference Result 176990 states and 632038 transitions. [2019-12-27 23:49:28,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:49:28,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 23:49:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:29,053 INFO L225 Difference]: With dead ends: 176990 [2019-12-27 23:49:29,053 INFO L226 Difference]: Without dead ends: 176990 [2019-12-27 23:49:29,054 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-27 23:49:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176990 states. [2019-12-27 23:49:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176990 to 172178. [2019-12-27 23:49:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172178 states. [2019-12-27 23:49:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172178 states to 172178 states and 617063 transitions. [2019-12-27 23:49:33,921 INFO L78 Accepts]: Start accepts. Automaton has 172178 states and 617063 transitions. Word has length 55 [2019-12-27 23:49:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:33,922 INFO L462 AbstractCegarLoop]: Abstraction has 172178 states and 617063 transitions. [2019-12-27 23:49:33,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:49:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 172178 states and 617063 transitions. [2019-12-27 23:49:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 23:49:33,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:33,945 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] [2019-12-27 23:49:33,945 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2138572392, now seen corresponding path program 1 times [2019-12-27 23:49:33,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:33,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762121921] [2019-12-27 23:49:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:49:34,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762121921] [2019-12-27 23:49:34,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:34,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:49:34,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804638877] [2019-12-27 23:49:34,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:34,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:34,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-27 23:49:34,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:34,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:34,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:49:34,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:49:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:34,080 INFO L87 Difference]: Start difference. First operand 172178 states and 617063 transitions. Second operand 6 states. [2019-12-27 23:49:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:36,555 INFO L93 Difference]: Finished difference Result 216117 states and 757196 transitions. [2019-12-27 23:49:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:49:36,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 23:49:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:37,098 INFO L225 Difference]: With dead ends: 216117 [2019-12-27 23:49:37,099 INFO L226 Difference]: Without dead ends: 216117 [2019-12-27 23:49:37,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:49:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216117 states. [2019-12-27 23:49:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216117 to 185518. [2019-12-27 23:49:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185518 states. [2019-12-27 23:49:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185518 states to 185518 states and 660438 transitions. [2019-12-27 23:49:48,857 INFO L78 Accepts]: Start accepts. Automaton has 185518 states and 660438 transitions. Word has length 56 [2019-12-27 23:49:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:48,857 INFO L462 AbstractCegarLoop]: Abstraction has 185518 states and 660438 transitions. [2019-12-27 23:49:48,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:49:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 185518 states and 660438 transitions. [2019-12-27 23:49:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 23:49:48,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:48,877 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] [2019-12-27 23:49:48,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1251068711, now seen corresponding path program 1 times [2019-12-27 23:49:48,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:48,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043510494] [2019-12-27 23:49:48,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:48,937 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-27 23:49:48,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043510494] [2019-12-27 23:49:48,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:48,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361514076] [2019-12-27 23:49:48,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:48,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:48,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-27 23:49:48,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:48,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:48,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:49:48,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:49:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:49:48,951 INFO L87 Difference]: Start difference. First operand 185518 states and 660438 transitions. Second operand 4 states. [2019-12-27 23:49:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:49,078 INFO L93 Difference]: Finished difference Result 24458 states and 76334 transitions. [2019-12-27 23:49:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:49:49,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 23:49:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:49,112 INFO L225 Difference]: With dead ends: 24458 [2019-12-27 23:49:49,112 INFO L226 Difference]: Without dead ends: 18439 [2019-12-27 23:49:49,112 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-27 23:49:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2019-12-27 23:49:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 18192. [2019-12-27 23:49:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-27 23:49:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 54575 transitions. [2019-12-27 23:49:49,337 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 54575 transitions. Word has length 56 [2019-12-27 23:49:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:49,337 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 54575 transitions. [2019-12-27 23:49:49,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:49:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 54575 transitions. [2019-12-27 23:49:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 23:49:49,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:49,342 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] [2019-12-27 23:49:49,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash 152468231, now seen corresponding path program 1 times [2019-12-27 23:49:49,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:49,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767207958] [2019-12-27 23:49:49,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:49,390 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-27 23:49:49,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767207958] [2019-12-27 23:49:49,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:49,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:49,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417341881] [2019-12-27 23:49:49,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:49,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:49,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-27 23:49:49,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:49,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:49:49,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:49:49,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:49:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:49:49,442 INFO L87 Difference]: Start difference. First operand 18192 states and 54575 transitions. Second operand 5 states. [2019-12-27 23:49:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:49,756 INFO L93 Difference]: Finished difference Result 23512 states and 70753 transitions. [2019-12-27 23:49:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:49:49,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 23:49:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:49,793 INFO L225 Difference]: With dead ends: 23512 [2019-12-27 23:49:49,793 INFO L226 Difference]: Without dead ends: 23512 [2019-12-27 23:49:49,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2019-12-27 23:49:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 21214. [2019-12-27 23:49:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21214 states. [2019-12-27 23:49:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21214 states to 21214 states and 63560 transitions. [2019-12-27 23:49:50,073 INFO L78 Accepts]: Start accepts. Automaton has 21214 states and 63560 transitions. Word has length 65 [2019-12-27 23:49:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:50,074 INFO L462 AbstractCegarLoop]: Abstraction has 21214 states and 63560 transitions. [2019-12-27 23:49:50,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:49:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21214 states and 63560 transitions. [2019-12-27 23:49:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 23:49:50,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:50,079 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] [2019-12-27 23:49:50,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:50,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1895278566, now seen corresponding path program 1 times [2019-12-27 23:49:50,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:50,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673712642] [2019-12-27 23:49:50,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:50,155 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-27 23:49:50,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673712642] [2019-12-27 23:49:50,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:50,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:49:50,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888207074] [2019-12-27 23:49:50,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:50,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:50,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-27 23:49:50,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:50,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:49:50,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:49:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:49:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:49:50,214 INFO L87 Difference]: Start difference. First operand 21214 states and 63560 transitions. Second operand 7 states. [2019-12-27 23:49:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:52,411 INFO L93 Difference]: Finished difference Result 30326 states and 89100 transitions. [2019-12-27 23:49:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:49:52,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 23:49:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:52,453 INFO L225 Difference]: With dead ends: 30326 [2019-12-27 23:49:52,453 INFO L226 Difference]: Without dead ends: 30278 [2019-12-27 23:49:52,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:49:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30278 states. [2019-12-27 23:49:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30278 to 27631. [2019-12-27 23:49:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-27 23:49:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 81447 transitions. [2019-12-27 23:49:52,822 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 81447 transitions. Word has length 65 [2019-12-27 23:49:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:52,822 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 81447 transitions. [2019-12-27 23:49:52,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:49:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 81447 transitions. [2019-12-27 23:49:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 23:49:52,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:52,832 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-27 23:49:52,832 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -279598761, now seen corresponding path program 1 times [2019-12-27 23:49:52,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:52,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339398935] [2019-12-27 23:49:52,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:52,872 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-27 23:49:52,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339398935] [2019-12-27 23:49:52,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:52,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:49:52,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409849176] [2019-12-27 23:49:52,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:52,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:52,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 255 transitions. [2019-12-27 23:49:52,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:52,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:49:52,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:49:52,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:49:52,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:49:52,949 INFO L87 Difference]: Start difference. First operand 27631 states and 81447 transitions. Second operand 5 states. [2019-12-27 23:49:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:53,117 INFO L93 Difference]: Finished difference Result 30274 states and 87661 transitions. [2019-12-27 23:49:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:49:53,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 23:49:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:53,158 INFO L225 Difference]: With dead ends: 30274 [2019-12-27 23:49:53,159 INFO L226 Difference]: Without dead ends: 30274 [2019-12-27 23:49:53,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:49:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2019-12-27 23:49:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 26779. [2019-12-27 23:49:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-27 23:49:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 76975 transitions. [2019-12-27 23:49:53,521 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 76975 transitions. Word has length 71 [2019-12-27 23:49:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 76975 transitions. [2019-12-27 23:49:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:49:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 76975 transitions. [2019-12-27 23:49:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 23:49:53,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:53,531 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] [2019-12-27 23:49:53,532 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash 214408150, now seen corresponding path program 1 times [2019-12-27 23:49:53,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377053517] [2019-12-27 23:49:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:53,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-27 23:49:53,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377053517] [2019-12-27 23:49:53,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:53,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:53,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068039896] [2019-12-27 23:49:53,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:53,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:53,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-27 23:49:53,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:53,802 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:53,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:49:53,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:49:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:49:53,803 INFO L87 Difference]: Start difference. First operand 26779 states and 76975 transitions. Second operand 4 states. [2019-12-27 23:49:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:54,570 INFO L93 Difference]: Finished difference Result 35101 states and 101171 transitions. [2019-12-27 23:49:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:49:54,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 23:49:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:54,619 INFO L225 Difference]: With dead ends: 35101 [2019-12-27 23:49:54,619 INFO L226 Difference]: Without dead ends: 34678 [2019-12-27 23:49:54,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 23:49:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34678 states. [2019-12-27 23:49:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34678 to 32875. [2019-12-27 23:49:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32875 states. [2019-12-27 23:49:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32875 states to 32875 states and 94659 transitions. [2019-12-27 23:49:55,054 INFO L78 Accepts]: Start accepts. Automaton has 32875 states and 94659 transitions. Word has length 73 [2019-12-27 23:49:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:55,054 INFO L462 AbstractCegarLoop]: Abstraction has 32875 states and 94659 transitions. [2019-12-27 23:49:55,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:49:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32875 states and 94659 transitions. [2019-12-27 23:49:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 23:49:55,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:55,067 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] [2019-12-27 23:49:55,067 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:55,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:55,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1582543209, now seen corresponding path program 1 times [2019-12-27 23:49:55,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:55,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139853904] [2019-12-27 23:49:55,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:55,183 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-27 23:49:55,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139853904] [2019-12-27 23:49:55,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:55,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:49:55,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906420993] [2019-12-27 23:49:55,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:55,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:55,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-27 23:49:55,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:55,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:49:55,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:49:55,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:55,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:49:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:49:55,342 INFO L87 Difference]: Start difference. First operand 32875 states and 94659 transitions. Second operand 10 states. [2019-12-27 23:49:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:57,093 INFO L93 Difference]: Finished difference Result 37960 states and 107978 transitions. [2019-12-27 23:49:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:49:57,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-27 23:49:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:57,162 INFO L225 Difference]: With dead ends: 37960 [2019-12-27 23:49:57,162 INFO L226 Difference]: Without dead ends: 37960 [2019-12-27 23:49:57,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:49:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2019-12-27 23:49:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 35135. [2019-12-27 23:49:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35135 states. [2019-12-27 23:49:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35135 states to 35135 states and 100532 transitions. [2019-12-27 23:49:57,862 INFO L78 Accepts]: Start accepts. Automaton has 35135 states and 100532 transitions. Word has length 73 [2019-12-27 23:49:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:57,863 INFO L462 AbstractCegarLoop]: Abstraction has 35135 states and 100532 transitions. [2019-12-27 23:49:57,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:49:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35135 states and 100532 transitions. [2019-12-27 23:49:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 23:49:57,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:57,879 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] [2019-12-27 23:49:57,879 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash -695039528, now seen corresponding path program 1 times [2019-12-27 23:49:57,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:57,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571253919] [2019-12-27 23:49:57,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:57,981 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-27 23:49:57,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571253919] [2019-12-27 23:49:57,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:57,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:49:57,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132292236] [2019-12-27 23:49:57,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:57,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:58,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-27 23:49:58,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:58,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:49:58,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:49:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:49:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:49:58,048 INFO L87 Difference]: Start difference. First operand 35135 states and 100532 transitions. Second operand 6 states. [2019-12-27 23:49:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:58,133 INFO L93 Difference]: Finished difference Result 10799 states and 26831 transitions. [2019-12-27 23:49:58,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:49:58,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-27 23:49:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:58,149 INFO L225 Difference]: With dead ends: 10799 [2019-12-27 23:49:58,149 INFO L226 Difference]: Without dead ends: 9416 [2019-12-27 23:49:58,150 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-27 23:49:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-12-27 23:49:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 7147. [2019-12-27 23:49:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7147 states. [2019-12-27 23:49:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 17805 transitions. [2019-12-27 23:49:58,280 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 17805 transitions. Word has length 73 [2019-12-27 23:49:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:58,280 INFO L462 AbstractCegarLoop]: Abstraction has 7147 states and 17805 transitions. [2019-12-27 23:49:58,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:49:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 17805 transitions. [2019-12-27 23:49:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:49:58,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:58,287 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, 1, 1, 1, 1, 1] [2019-12-27 23:49:58,288 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1038400068, now seen corresponding path program 1 times [2019-12-27 23:49:58,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:58,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801794684] [2019-12-27 23:49:58,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:58,352 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-27 23:49:58,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801794684] [2019-12-27 23:49:58,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:58,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:49:58,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300381711] [2019-12-27 23:49:58,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:58,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:58,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:49:58,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:58,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:49:58,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:49:58,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:49:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:49:58,497 INFO L87 Difference]: Start difference. First operand 7147 states and 17805 transitions. Second operand 4 states. [2019-12-27 23:49:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:49:58,772 INFO L93 Difference]: Finished difference Result 8303 states and 20316 transitions. [2019-12-27 23:49:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:49:58,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-27 23:49:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:49:58,782 INFO L225 Difference]: With dead ends: 8303 [2019-12-27 23:49:58,782 INFO L226 Difference]: Without dead ends: 8303 [2019-12-27 23:49:58,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:49:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-12-27 23:49:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 7769. [2019-12-27 23:49:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7769 states. [2019-12-27 23:49:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7769 states to 7769 states and 19157 transitions. [2019-12-27 23:49:58,872 INFO L78 Accepts]: Start accepts. Automaton has 7769 states and 19157 transitions. Word has length 102 [2019-12-27 23:49:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:49:58,873 INFO L462 AbstractCegarLoop]: Abstraction has 7769 states and 19157 transitions. [2019-12-27 23:49:58,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:49:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7769 states and 19157 transitions. [2019-12-27 23:49:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:49:58,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:49:58,880 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, 1, 1, 1, 1, 1] [2019-12-27 23:49:58,880 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:49:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:49:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2011802747, now seen corresponding path program 1 times [2019-12-27 23:49:58,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:49:58,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117365066] [2019-12-27 23:49:58,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:49:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:49:59,086 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-27 23:49:59,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117365066] [2019-12-27 23:49:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:49:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:49:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443886083] [2019-12-27 23:49:59,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:49:59,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:49:59,208 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:49:59,208 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:49:59,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:49:59,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:49:59,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:49:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:49:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:49:59,239 INFO L87 Difference]: Start difference. First operand 7769 states and 19157 transitions. Second operand 9 states. [2019-12-27 23:50:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:00,960 INFO L93 Difference]: Finished difference Result 17428 states and 41395 transitions. [2019-12-27 23:50:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:50:00,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-12-27 23:50:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:00,983 INFO L225 Difference]: With dead ends: 17428 [2019-12-27 23:50:00,983 INFO L226 Difference]: Without dead ends: 17277 [2019-12-27 23:50:00,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:50:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2019-12-27 23:50:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 10248. [2019-12-27 23:50:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10248 states. [2019-12-27 23:50:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 24634 transitions. [2019-12-27 23:50:01,163 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 24634 transitions. Word has length 102 [2019-12-27 23:50:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:01,163 INFO L462 AbstractCegarLoop]: Abstraction has 10248 states and 24634 transitions. [2019-12-27 23:50:01,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:50:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 24634 transitions. [2019-12-27 23:50:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:01,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:01,174 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:01,174 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 205955206, now seen corresponding path program 1 times [2019-12-27 23:50:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747737235] [2019-12-27 23:50:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:01,299 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-27 23:50:01,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747737235] [2019-12-27 23:50:01,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:01,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:50:01,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922764191] [2019-12-27 23:50:01,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:01,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:01,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:50:01,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:01,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:50:01,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:50:01,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:50:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:50:01,475 INFO L87 Difference]: Start difference. First operand 10248 states and 24634 transitions. Second operand 9 states. [2019-12-27 23:50:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:03,355 INFO L93 Difference]: Finished difference Result 18533 states and 42897 transitions. [2019-12-27 23:50:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 23:50:03,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-12-27 23:50:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:03,375 INFO L225 Difference]: With dead ends: 18533 [2019-12-27 23:50:03,375 INFO L226 Difference]: Without dead ends: 18533 [2019-12-27 23:50:03,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:50:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18533 states. [2019-12-27 23:50:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18533 to 11352. [2019-12-27 23:50:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11352 states. [2019-12-27 23:50:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11352 states to 11352 states and 26506 transitions. [2019-12-27 23:50:03,539 INFO L78 Accepts]: Start accepts. Automaton has 11352 states and 26506 transitions. Word has length 102 [2019-12-27 23:50:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:03,539 INFO L462 AbstractCegarLoop]: Abstraction has 11352 states and 26506 transitions. [2019-12-27 23:50:03,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:50:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11352 states and 26506 transitions. [2019-12-27 23:50:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:03,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:03,550 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:03,550 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 417306119, now seen corresponding path program 1 times [2019-12-27 23:50:03,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:03,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569839254] [2019-12-27 23:50:03,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:03,646 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-27 23:50:03,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569839254] [2019-12-27 23:50:03,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:03,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:50:03,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418086681] [2019-12-27 23:50:03,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:03,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:03,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:50:03,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:03,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:50:03,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:50:03,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:50:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:50:03,839 INFO L87 Difference]: Start difference. First operand 11352 states and 26506 transitions. Second operand 9 states. [2019-12-27 23:50:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:05,811 INFO L93 Difference]: Finished difference Result 22448 states and 51824 transitions. [2019-12-27 23:50:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:50:05,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-12-27 23:50:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:05,836 INFO L225 Difference]: With dead ends: 22448 [2019-12-27 23:50:05,836 INFO L226 Difference]: Without dead ends: 22448 [2019-12-27 23:50:05,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:50:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22448 states. [2019-12-27 23:50:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22448 to 14194. [2019-12-27 23:50:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14194 states. [2019-12-27 23:50:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14194 states to 14194 states and 33173 transitions. [2019-12-27 23:50:06,041 INFO L78 Accepts]: Start accepts. Automaton has 14194 states and 33173 transitions. Word has length 102 [2019-12-27 23:50:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:06,041 INFO L462 AbstractCegarLoop]: Abstraction has 14194 states and 33173 transitions. [2019-12-27 23:50:06,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:50:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14194 states and 33173 transitions. [2019-12-27 23:50:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:06,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:06,054 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:06,054 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1890179417, now seen corresponding path program 1 times [2019-12-27 23:50:06,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:06,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236814835] [2019-12-27 23:50:06,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:06,243 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-27 23:50:06,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236814835] [2019-12-27 23:50:06,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:06,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:50:06,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035427818] [2019-12-27 23:50:06,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:06,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:06,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:50:06,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:06,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:50:06,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:50:06,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:50:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:50:06,374 INFO L87 Difference]: Start difference. First operand 14194 states and 33173 transitions. Second operand 7 states. [2019-12-27 23:50:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:06,807 INFO L93 Difference]: Finished difference Result 14895 states and 34609 transitions. [2019-12-27 23:50:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:50:06,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 23:50:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:06,829 INFO L225 Difference]: With dead ends: 14895 [2019-12-27 23:50:06,829 INFO L226 Difference]: Without dead ends: 14895 [2019-12-27 23:50:06,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:50:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2019-12-27 23:50:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 12310. [2019-12-27 23:50:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12310 states. [2019-12-27 23:50:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12310 states to 12310 states and 28696 transitions. [2019-12-27 23:50:07,046 INFO L78 Accepts]: Start accepts. Automaton has 12310 states and 28696 transitions. Word has length 102 [2019-12-27 23:50:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:07,047 INFO L462 AbstractCegarLoop]: Abstraction has 12310 states and 28696 transitions. [2019-12-27 23:50:07,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:50:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12310 states and 28696 transitions. [2019-12-27 23:50:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:07,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:07,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:50:07,063 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1002675736, now seen corresponding path program 1 times [2019-12-27 23:50:07,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:07,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913796849] [2019-12-27 23:50:07,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:07,158 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-27 23:50:07,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913796849] [2019-12-27 23:50:07,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:07,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:50:07,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703477271] [2019-12-27 23:50:07,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:07,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:07,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-27 23:50:07,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:07,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:50:07,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:50:07,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:07,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:50:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:50:07,299 INFO L87 Difference]: Start difference. First operand 12310 states and 28696 transitions. Second operand 4 states. [2019-12-27 23:50:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:07,576 INFO L93 Difference]: Finished difference Result 12779 states and 29795 transitions. [2019-12-27 23:50:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:50:07,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-27 23:50:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:07,595 INFO L225 Difference]: With dead ends: 12779 [2019-12-27 23:50:07,595 INFO L226 Difference]: Without dead ends: 12779 [2019-12-27 23:50:07,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:50:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-12-27 23:50:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11908. [2019-12-27 23:50:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11908 states. [2019-12-27 23:50:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 27810 transitions. [2019-12-27 23:50:07,785 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 27810 transitions. Word has length 102 [2019-12-27 23:50:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:07,785 INFO L462 AbstractCegarLoop]: Abstraction has 11908 states and 27810 transitions. [2019-12-27 23:50:07,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:50:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 27810 transitions. [2019-12-27 23:50:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:07,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:07,800 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:07,800 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1721649504, now seen corresponding path program 2 times [2019-12-27 23:50:07,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:07,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893954084] [2019-12-27 23:50:07,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:07,875 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-27 23:50:07,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893954084] [2019-12-27 23:50:07,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:07,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:50:07,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696804475] [2019-12-27 23:50:07,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:07,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:08,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 308 transitions. [2019-12-27 23:50:08,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:08,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:50:08,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:50:08,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:50:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:50:08,116 INFO L87 Difference]: Start difference. First operand 11908 states and 27810 transitions. Second operand 5 states. [2019-12-27 23:50:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:08,536 INFO L93 Difference]: Finished difference Result 12919 states and 30023 transitions. [2019-12-27 23:50:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:50:08,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-27 23:50:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:08,550 INFO L225 Difference]: With dead ends: 12919 [2019-12-27 23:50:08,551 INFO L226 Difference]: Without dead ends: 12919 [2019-12-27 23:50:08,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:50:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2019-12-27 23:50:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 11874. [2019-12-27 23:50:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11874 states. [2019-12-27 23:50:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11874 states to 11874 states and 27674 transitions. [2019-12-27 23:50:08,691 INFO L78 Accepts]: Start accepts. Automaton has 11874 states and 27674 transitions. Word has length 102 [2019-12-27 23:50:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:08,691 INFO L462 AbstractCegarLoop]: Abstraction has 11874 states and 27674 transitions. [2019-12-27 23:50:08,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:50:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 11874 states and 27674 transitions. [2019-12-27 23:50:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:08,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:08,702 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:08,703 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1014677636, now seen corresponding path program 3 times [2019-12-27 23:50:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:08,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934741179] [2019-12-27 23:50:08,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:08,784 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-27 23:50:08,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934741179] [2019-12-27 23:50:08,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:08,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:50:08,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736460472] [2019-12-27 23:50:08,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:08,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:08,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 312 transitions. [2019-12-27 23:50:08,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:08,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:50:08,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:50:08,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:50:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:50:08,962 INFO L87 Difference]: Start difference. First operand 11874 states and 27674 transitions. Second operand 7 states. [2019-12-27 23:50:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:09,399 INFO L93 Difference]: Finished difference Result 15000 states and 34941 transitions. [2019-12-27 23:50:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:50:09,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 23:50:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:09,416 INFO L225 Difference]: With dead ends: 15000 [2019-12-27 23:50:09,416 INFO L226 Difference]: Without dead ends: 15000 [2019-12-27 23:50:09,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:50:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-27 23:50:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11904. [2019-12-27 23:50:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11904 states. [2019-12-27 23:50:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 27737 transitions. [2019-12-27 23:50:09,567 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 27737 transitions. Word has length 102 [2019-12-27 23:50:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:09,568 INFO L462 AbstractCegarLoop]: Abstraction has 11904 states and 27737 transitions. [2019-12-27 23:50:09,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:50:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 27737 transitions. [2019-12-27 23:50:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:50:09,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:09,579 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, 1, 1, 1, 1, 1] [2019-12-27 23:50:09,579 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 672175224, now seen corresponding path program 4 times [2019-12-27 23:50:09,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:09,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404359207] [2019-12-27 23:50:09,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:09,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-27 23:50:09,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404359207] [2019-12-27 23:50:09,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:09,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:50:09,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758075480] [2019-12-27 23:50:09,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:09,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:09,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 244 transitions. [2019-12-27 23:50:09,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:09,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:50:09,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:50:09,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:50:09,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:50:09,795 INFO L87 Difference]: Start difference. First operand 11904 states and 27737 transitions. Second operand 6 states. [2019-12-27 23:50:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:10,174 INFO L93 Difference]: Finished difference Result 13902 states and 31888 transitions. [2019-12-27 23:50:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:50:10,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-27 23:50:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:10,196 INFO L225 Difference]: With dead ends: 13902 [2019-12-27 23:50:10,196 INFO L226 Difference]: Without dead ends: 13902 [2019-12-27 23:50:10,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:50:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13902 states. [2019-12-27 23:50:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13902 to 12062. [2019-12-27 23:50:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12062 states. [2019-12-27 23:50:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12062 states to 12062 states and 28075 transitions. [2019-12-27 23:50:10,571 INFO L78 Accepts]: Start accepts. Automaton has 12062 states and 28075 transitions. Word has length 102 [2019-12-27 23:50:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:10,571 INFO L462 AbstractCegarLoop]: Abstraction has 12062 states and 28075 transitions. [2019-12-27 23:50:10,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:50:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12062 states and 28075 transitions. [2019-12-27 23:50:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:10,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:10,591 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:10,592 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 680863437, now seen corresponding path program 1 times [2019-12-27 23:50:10,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:10,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030127179] [2019-12-27 23:50:10,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:10,640 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-27 23:50:10,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030127179] [2019-12-27 23:50:10,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:10,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:50:10,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086448757] [2019-12-27 23:50:10,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:10,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:10,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 214 transitions. [2019-12-27 23:50:10,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:10,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:50:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:50:10,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:50:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:50:10,783 INFO L87 Difference]: Start difference. First operand 12062 states and 28075 transitions. Second operand 3 states. [2019-12-27 23:50:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:10,869 INFO L93 Difference]: Finished difference Result 14746 states and 34320 transitions. [2019-12-27 23:50:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:50:10,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-27 23:50:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:10,899 INFO L225 Difference]: With dead ends: 14746 [2019-12-27 23:50:10,899 INFO L226 Difference]: Without dead ends: 14746 [2019-12-27 23:50:10,900 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-27 23:50:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14746 states. [2019-12-27 23:50:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14746 to 14684. [2019-12-27 23:50:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14684 states. [2019-12-27 23:50:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14684 states to 14684 states and 34187 transitions. [2019-12-27 23:50:11,242 INFO L78 Accepts]: Start accepts. Automaton has 14684 states and 34187 transitions. Word has length 104 [2019-12-27 23:50:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:11,242 INFO L462 AbstractCegarLoop]: Abstraction has 14684 states and 34187 transitions. [2019-12-27 23:50:11,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:50:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14684 states and 34187 transitions. [2019-12-27 23:50:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:11,266 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:11,266 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1031663374, now seen corresponding path program 1 times [2019-12-27 23:50:11,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:11,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417557332] [2019-12-27 23:50:11,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:11,494 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-27 23:50:11,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417557332] [2019-12-27 23:50:11,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:11,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:50:11,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800885753] [2019-12-27 23:50:11,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:11,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:11,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 214 transitions. [2019-12-27 23:50:11,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:11,680 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:50:11,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:50:11,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:11,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:50:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:50:11,687 INFO L87 Difference]: Start difference. First operand 14684 states and 34187 transitions. Second operand 12 states. [2019-12-27 23:50:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:12,471 INFO L93 Difference]: Finished difference Result 32725 states and 75642 transitions. [2019-12-27 23:50:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 23:50:12,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-27 23:50:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:12,511 INFO L225 Difference]: With dead ends: 32725 [2019-12-27 23:50:12,511 INFO L226 Difference]: Without dead ends: 25948 [2019-12-27 23:50:12,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:50:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25948 states. [2019-12-27 23:50:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25948 to 19701. [2019-12-27 23:50:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19701 states. [2019-12-27 23:50:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19701 states to 19701 states and 45788 transitions. [2019-12-27 23:50:12,919 INFO L78 Accepts]: Start accepts. Automaton has 19701 states and 45788 transitions. Word has length 104 [2019-12-27 23:50:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:12,919 INFO L462 AbstractCegarLoop]: Abstraction has 19701 states and 45788 transitions. [2019-12-27 23:50:12,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:50:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19701 states and 45788 transitions. [2019-12-27 23:50:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:12,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:12,935 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:12,935 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1264987764, now seen corresponding path program 2 times [2019-12-27 23:50:12,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:12,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075668552] [2019-12-27 23:50:12,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:13,140 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-27 23:50:13,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075668552] [2019-12-27 23:50:13,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:13,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:50:13,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817746878] [2019-12-27 23:50:13,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:13,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:13,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 214 transitions. [2019-12-27 23:50:13,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:13,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:50:13,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:50:13,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:50:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:50:13,241 INFO L87 Difference]: Start difference. First operand 19701 states and 45788 transitions. Second operand 12 states. [2019-12-27 23:50:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:14,185 INFO L93 Difference]: Finished difference Result 39036 states and 89872 transitions. [2019-12-27 23:50:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:50:14,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-27 23:50:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:14,224 INFO L225 Difference]: With dead ends: 39036 [2019-12-27 23:50:14,224 INFO L226 Difference]: Without dead ends: 36043 [2019-12-27 23:50:14,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:50:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36043 states. [2019-12-27 23:50:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36043 to 23820. [2019-12-27 23:50:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23820 states. [2019-12-27 23:50:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23820 states to 23820 states and 55442 transitions. [2019-12-27 23:50:14,548 INFO L78 Accepts]: Start accepts. Automaton has 23820 states and 55442 transitions. Word has length 104 [2019-12-27 23:50:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:14,548 INFO L462 AbstractCegarLoop]: Abstraction has 23820 states and 55442 transitions. [2019-12-27 23:50:14,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:50:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23820 states and 55442 transitions. [2019-12-27 23:50:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:14,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:14,570 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:14,570 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1268769222, now seen corresponding path program 1 times [2019-12-27 23:50:14,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:14,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760070986] [2019-12-27 23:50:14,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:14,708 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-27 23:50:14,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760070986] [2019-12-27 23:50:14,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:14,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:50:14,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100926991] [2019-12-27 23:50:14,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:14,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:14,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 294 transitions. [2019-12-27 23:50:14,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:15,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:50:15,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:50:15,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:50:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:50:15,204 INFO L87 Difference]: Start difference. First operand 23820 states and 55442 transitions. Second operand 15 states. [2019-12-27 23:50:15,986 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 23:50:16,199 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 23:50:18,873 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-27 23:50:19,476 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-27 23:50:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:21,012 INFO L93 Difference]: Finished difference Result 38036 states and 87480 transitions. [2019-12-27 23:50:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:50:21,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 104 [2019-12-27 23:50:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:21,021 INFO L225 Difference]: With dead ends: 38036 [2019-12-27 23:50:21,021 INFO L226 Difference]: Without dead ends: 7452 [2019-12-27 23:50:21,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=677, Invalid=1675, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 23:50:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2019-12-27 23:50:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 3078. [2019-12-27 23:50:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3078 states. [2019-12-27 23:50:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 7215 transitions. [2019-12-27 23:50:21,073 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 7215 transitions. Word has length 104 [2019-12-27 23:50:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:21,074 INFO L462 AbstractCegarLoop]: Abstraction has 3078 states and 7215 transitions. [2019-12-27 23:50:21,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:50:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 7215 transitions. [2019-12-27 23:50:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:21,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:21,077 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:21,077 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1538969505, now seen corresponding path program 1 times [2019-12-27 23:50:21,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:21,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368052340] [2019-12-27 23:50:21,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:21,140 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-27 23:50:21,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368052340] [2019-12-27 23:50:21,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:21,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:50:21,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523604601] [2019-12-27 23:50:21,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:21,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:21,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-27 23:50:21,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:21,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:50:21,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:50:21,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:50:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:50:21,273 INFO L87 Difference]: Start difference. First operand 3078 states and 7215 transitions. Second operand 7 states. [2019-12-27 23:50:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:22,175 INFO L93 Difference]: Finished difference Result 4422 states and 10180 transitions. [2019-12-27 23:50:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:50:22,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-27 23:50:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:22,181 INFO L225 Difference]: With dead ends: 4422 [2019-12-27 23:50:22,182 INFO L226 Difference]: Without dead ends: 4400 [2019-12-27 23:50:22,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:50:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-12-27 23:50:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3130. [2019-12-27 23:50:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2019-12-27 23:50:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 7331 transitions. [2019-12-27 23:50:22,219 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 7331 transitions. Word has length 104 [2019-12-27 23:50:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:22,220 INFO L462 AbstractCegarLoop]: Abstraction has 3130 states and 7331 transitions. [2019-12-27 23:50:22,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:50:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 7331 transitions. [2019-12-27 23:50:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:22,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:22,223 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:22,223 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1502982559, now seen corresponding path program 1 times [2019-12-27 23:50:22,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:22,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670444484] [2019-12-27 23:50:22,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:22,376 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-27 23:50:22,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670444484] [2019-12-27 23:50:22,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:22,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:50:22,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323847399] [2019-12-27 23:50:22,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:22,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:22,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-27 23:50:22,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:22,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:50:22,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:50:22,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:50:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:50:22,578 INFO L87 Difference]: Start difference. First operand 3130 states and 7331 transitions. Second operand 9 states. [2019-12-27 23:50:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:23,359 INFO L93 Difference]: Finished difference Result 3709 states and 8569 transitions. [2019-12-27 23:50:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:50:23,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-12-27 23:50:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:23,365 INFO L225 Difference]: With dead ends: 3709 [2019-12-27 23:50:23,365 INFO L226 Difference]: Without dead ends: 3709 [2019-12-27 23:50:23,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:50:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2019-12-27 23:50:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3118. [2019-12-27 23:50:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-12-27 23:50:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 7296 transitions. [2019-12-27 23:50:23,398 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 7296 transitions. Word has length 104 [2019-12-27 23:50:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:23,399 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 7296 transitions. [2019-12-27 23:50:23,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:50:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 7296 transitions. [2019-12-27 23:50:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:23,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:23,402 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:23,402 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1904481056, now seen corresponding path program 1 times [2019-12-27 23:50:23,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:23,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541978917] [2019-12-27 23:50:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:23,490 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-27 23:50:23,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541978917] [2019-12-27 23:50:23,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:23,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:50:23,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822771656] [2019-12-27 23:50:23,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:23,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:23,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-27 23:50:23,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:23,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:50:23,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:50:23,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:50:23,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:50:23,582 INFO L87 Difference]: Start difference. First operand 3118 states and 7296 transitions. Second operand 7 states. [2019-12-27 23:50:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:23,912 INFO L93 Difference]: Finished difference Result 3485 states and 8227 transitions. [2019-12-27 23:50:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:50:23,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-27 23:50:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:23,918 INFO L225 Difference]: With dead ends: 3485 [2019-12-27 23:50:23,918 INFO L226 Difference]: Without dead ends: 3485 [2019-12-27 23:50:23,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:50:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2019-12-27 23:50:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3060. [2019-12-27 23:50:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3060 states. [2019-12-27 23:50:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 7178 transitions. [2019-12-27 23:50:23,950 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 7178 transitions. Word has length 104 [2019-12-27 23:50:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:23,951 INFO L462 AbstractCegarLoop]: Abstraction has 3060 states and 7178 transitions. [2019-12-27 23:50:23,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:50:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 7178 transitions. [2019-12-27 23:50:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:23,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:23,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:23,954 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash 636284413, now seen corresponding path program 2 times [2019-12-27 23:50:23,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:23,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407869849] [2019-12-27 23:50:23,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:50:24,130 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-27 23:50:24,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407869849] [2019-12-27 23:50:24,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:50:24,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:50:24,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561159971] [2019-12-27 23:50:24,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:50:24,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:50:24,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 200 transitions. [2019-12-27 23:50:24,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:50:24,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:50:24,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:50:24,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:50:24,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:50:24,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:50:24,269 INFO L87 Difference]: Start difference. First operand 3060 states and 7178 transitions. Second operand 12 states. [2019-12-27 23:50:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:50:26,374 INFO L93 Difference]: Finished difference Result 9344 states and 21287 transitions. [2019-12-27 23:50:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:50:26,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-27 23:50:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:50:26,381 INFO L225 Difference]: With dead ends: 9344 [2019-12-27 23:50:26,382 INFO L226 Difference]: Without dead ends: 5483 [2019-12-27 23:50:26,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:50:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-12-27 23:50:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 3214. [2019-12-27 23:50:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2019-12-27 23:50:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 7451 transitions. [2019-12-27 23:50:26,426 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 7451 transitions. Word has length 104 [2019-12-27 23:50:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:50:26,426 INFO L462 AbstractCegarLoop]: Abstraction has 3214 states and 7451 transitions. [2019-12-27 23:50:26,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:50:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 7451 transitions. [2019-12-27 23:50:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 23:50:26,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:50:26,430 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:50:26,430 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:50:26,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:50:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 586103867, now seen corresponding path program 3 times [2019-12-27 23:50:26,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:50:26,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35921851] [2019-12-27 23:50:26,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:50:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:50:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:50:26,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:50:26,523 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:50:26,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:50:26 BasicIcfg [2019-12-27 23:50:26,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:50:26,746 INFO L168 Benchmark]: Toolchain (without parser) took 159234.60 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 552.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,746 INFO L168 Benchmark]: CDTParser took 0.22 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.54 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 155.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.33 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,747 INFO L168 Benchmark]: Boogie Preprocessor took 61.43 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,748 INFO L168 Benchmark]: RCFGBuilder took 945.53 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 97.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,751 INFO L168 Benchmark]: TraceAbstraction took 157346.36 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 491.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:50:26,753 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.54 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 155.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.33 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.43 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 945.53 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 97.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157346.36 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 491.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L716] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L717] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L718] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L719] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L720] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L721] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L812] 0 pthread_t t4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L813] FCALL, FORK 0 pthread_create(&t4, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L814] 0 pthread_t t5; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L815] FCALL, FORK 0 pthread_create(&t5, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 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 [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] 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 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 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) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 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 [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 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 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 73.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13483 SDtfs, 20918 SDslu, 45691 SDs, 0 SdLazy, 17988 SolverSat, 1006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 178 SyntacticMatches, 31 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222094occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 66.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 263728 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2794 NumberOfCodeBlocks, 2794 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2657 ConstructedInterpolants, 0 QuantifiedInterpolants, 648155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...