/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:49:29,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:49:29,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:49:29,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:49:29,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:49:29,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:49:29,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:49:29,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:49:29,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:49:29,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:49:29,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:49:29,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:49:29,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:49:29,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:49:29,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:49:29,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:49:29,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:49:29,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:49:29,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:49:29,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:49:29,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:49:29,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:49:29,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:49:29,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:49:29,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:49:29,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:49:29,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:49:29,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:49:29,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:49:29,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:49:29,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:49:29,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:49:29,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:49:29,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:49:29,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:49:29,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:49:29,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:49:29,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:49:29,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:49:29,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:49:29,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:49:29,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 03:49:29,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:49:29,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:49:29,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:49:29,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:49:29,567 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:49:29,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:49:29,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:49:29,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:49:29,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:49:29,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:49:29,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:49:29,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:49:29,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:49:29,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:49:29,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:49:29,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:49:29,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:49:29,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:49:29,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:49:29,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:49:29,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:49:29,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:49:29,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:49:29,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:49:29,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:49:29,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:49:29,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:49:29,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:49:29,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:49:29,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:49:29,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:49:29,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:49:29,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:49:29,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:49:29,864 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:49:29,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-19 03:49:29,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df455ecf/13ce0934acf14cbba6ae05ecfd44574d/FLAG6c8239a36 [2019-12-19 03:49:30,431 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:49:30,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-19 03:49:30,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df455ecf/13ce0934acf14cbba6ae05ecfd44574d/FLAG6c8239a36 [2019-12-19 03:49:30,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df455ecf/13ce0934acf14cbba6ae05ecfd44574d [2019-12-19 03:49:30,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:49:30,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:49:30,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:49:30,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:49:30,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:49:30,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:49:30" (1/1) ... [2019-12-19 03:49:30,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5910708c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:30, skipping insertion in model container [2019-12-19 03:49:30,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:49:30" (1/1) ... [2019-12-19 03:49:30,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:49:30,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:49:31,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:49:31,396 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:49:31,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:49:31,553 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:49:31,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31 WrapperNode [2019-12-19 03:49:31,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:49:31,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:49:31,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:49:31,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:49:31,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:49:31,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:49:31,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:49:31,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:49:31,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... [2019-12-19 03:49:31,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:49:31,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:49:31,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:49:31,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:49:31,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:49:31,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:49:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:49:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:49:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:49:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:49:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:49:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:49:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:49:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:49:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:49:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:49:31,733 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:49:32,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:49:32,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:49:32,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:49:32 BoogieIcfgContainer [2019-12-19 03:49:32,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:49:32,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:49:32,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:49:32,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:49:32,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:49:30" (1/3) ... [2019-12-19 03:49:32,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:49:32, skipping insertion in model container [2019-12-19 03:49:32,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:49:31" (2/3) ... [2019-12-19 03:49:32,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:49:32, skipping insertion in model container [2019-12-19 03:49:32,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:49:32" (3/3) ... [2019-12-19 03:49:32,430 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-19 03:49:32,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:49:32,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:49:32,454 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:49:32,455 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:49:32,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:49:32,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:49:32,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:49:32,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:49:32,582 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:49:32,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:49:32,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:49:32,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:49:32,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:49:32,583 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:49:32,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 164 transitions [2019-12-19 03:49:34,177 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-12-19 03:49:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-12-19 03:49:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 03:49:34,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:34,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:34,191 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2111627556, now seen corresponding path program 1 times [2019-12-19 03:49:34,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:34,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713316799] [2019-12-19 03:49:34,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:34,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713316799] [2019-12-19 03:49:34,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:34,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:49:34,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354354820] [2019-12-19 03:49:34,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:49:34,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:49:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:49:34,580 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-12-19 03:49:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:36,067 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-12-19 03:49:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:49:36,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 03:49:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:36,298 INFO L225 Difference]: With dead ends: 26616 [2019-12-19 03:49:36,298 INFO L226 Difference]: Without dead ends: 20360 [2019-12-19 03:49:36,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:49:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-19 03:49:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-12-19 03:49:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-19 03:49:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-12-19 03:49:37,381 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-12-19 03:49:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:37,382 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-12-19 03:49:37,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:49:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-12-19 03:49:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 03:49:37,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:37,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:37,391 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 341542856, now seen corresponding path program 1 times [2019-12-19 03:49:37,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:37,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994313452] [2019-12-19 03:49:37,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:37,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994313452] [2019-12-19 03:49:37,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:37,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:49:37,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723857720] [2019-12-19 03:49:37,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:49:37,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:49:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:49:37,561 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-12-19 03:49:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:38,525 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-12-19 03:49:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:49:38,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 03:49:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:38,660 INFO L225 Difference]: With dead ends: 31838 [2019-12-19 03:49:38,661 INFO L226 Difference]: Without dead ends: 31286 [2019-12-19 03:49:38,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:49:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-12-19 03:49:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-12-19 03:49:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-12-19 03:49:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-12-19 03:49:40,876 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-12-19 03:49:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:40,878 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-12-19 03:49:40,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:49:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-12-19 03:49:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:49:40,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:40,884 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-19 03:49:40,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1959299271, now seen corresponding path program 1 times [2019-12-19 03:49:40,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:40,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937829465] [2019-12-19 03:49:40,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:40,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-19 03:49:40,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937829465] [2019-12-19 03:49:40,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:40,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:49:40,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537694164] [2019-12-19 03:49:40,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:49:40,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:49:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:49:40,985 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-12-19 03:49:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:41,528 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-12-19 03:49:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:49:41,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 03:49:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:41,679 INFO L225 Difference]: With dead ends: 38696 [2019-12-19 03:49:41,680 INFO L226 Difference]: Without dead ends: 38248 [2019-12-19 03:49:41,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:49:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-12-19 03:49:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-12-19 03:49:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-12-19 03:49:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-12-19 03:49:43,994 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-12-19 03:49:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:43,994 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-12-19 03:49:43,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:49:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-12-19 03:49:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 03:49:44,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:44,006 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] [2019-12-19 03:49:44,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:44,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1720517523, now seen corresponding path program 1 times [2019-12-19 03:49:44,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:44,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727148319] [2019-12-19 03:49:44,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:44,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727148319] [2019-12-19 03:49:44,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:44,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:49:44,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731448232] [2019-12-19 03:49:44,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:49:44,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:49:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:49:44,076 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-12-19 03:49:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:44,532 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-12-19 03:49:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:49:44,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 03:49:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:44,652 INFO L225 Difference]: With dead ends: 42412 [2019-12-19 03:49:44,652 INFO L226 Difference]: Without dead ends: 42412 [2019-12-19 03:49:44,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:49:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-12-19 03:49:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-12-19 03:49:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-12-19 03:49:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-12-19 03:49:47,149 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-12-19 03:49:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:47,150 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-12-19 03:49:47,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:49:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-12-19 03:49:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:49:47,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:47,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:47,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1662860822, now seen corresponding path program 1 times [2019-12-19 03:49:47,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:47,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882325235] [2019-12-19 03:49:47,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:47,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882325235] [2019-12-19 03:49:47,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:47,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:49:47,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358386258] [2019-12-19 03:49:47,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:49:47,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:49:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:49:47,260 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-12-19 03:49:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:47,965 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-12-19 03:49:47,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:49:47,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:49:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:48,100 INFO L225 Difference]: With dead ends: 48756 [2019-12-19 03:49:48,100 INFO L226 Difference]: Without dead ends: 48236 [2019-12-19 03:49:48,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 03:49:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-19 03:49:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-12-19 03:49:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-12-19 03:49:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-12-19 03:49:49,269 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-12-19 03:49:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:49,270 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-12-19 03:49:49,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:49:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-12-19 03:49:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:49:49,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:49,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:49,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1119592545, now seen corresponding path program 1 times [2019-12-19 03:49:49,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:49,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627179817] [2019-12-19 03:49:49,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:49,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627179817] [2019-12-19 03:49:49,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:49,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:49:49,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970667893] [2019-12-19 03:49:49,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:49:49,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:49:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:49:49,352 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-12-19 03:49:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:51,269 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-12-19 03:49:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:49:51,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 03:49:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:51,377 INFO L225 Difference]: With dead ends: 42347 [2019-12-19 03:49:51,377 INFO L226 Difference]: Without dead ends: 42347 [2019-12-19 03:49:51,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:49:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-12-19 03:49:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-12-19 03:49:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-12-19 03:49:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-12-19 03:49:52,235 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-12-19 03:49:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:52,235 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-12-19 03:49:52,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:49:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-12-19 03:49:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:49:52,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:52,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:52,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1661323295, now seen corresponding path program 1 times [2019-12-19 03:49:52,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:52,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130246430] [2019-12-19 03:49:52,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:52,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130246430] [2019-12-19 03:49:52,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:52,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:49:52,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619372354] [2019-12-19 03:49:52,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:49:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:49:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:49:52,636 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 6 states. [2019-12-19 03:49:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:53,376 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-12-19 03:49:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:49:53,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:49:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:53,486 INFO L225 Difference]: With dead ends: 54445 [2019-12-19 03:49:53,487 INFO L226 Difference]: Without dead ends: 53469 [2019-12-19 03:49:53,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:49:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-12-19 03:49:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-12-19 03:49:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-12-19 03:49:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-12-19 03:49:54,716 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-12-19 03:49:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:49:54,716 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-12-19 03:49:54,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:49:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-12-19 03:49:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:49:54,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:49:54,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:49:54,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:49:54,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:49:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash -135628064, now seen corresponding path program 1 times [2019-12-19 03:49:54,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:49:54,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009969976] [2019-12-19 03:49:54,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:49:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:49:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:49:54,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009969976] [2019-12-19 03:49:54,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:49:54,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:49:54,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50113444] [2019-12-19 03:49:54,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:49:54,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:49:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:49:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:49:54,837 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-12-19 03:49:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:49:56,029 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-12-19 03:49:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:49:56,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 03:49:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:49:56,581 INFO L225 Difference]: With dead ends: 70897 [2019-12-19 03:49:56,581 INFO L226 Difference]: Without dead ends: 70897 [2019-12-19 03:49:56,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:49:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-12-19 03:50:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-12-19 03:50:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-12-19 03:50:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-12-19 03:50:00,159 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-12-19 03:50:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:00,159 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-12-19 03:50:00,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:50:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-12-19 03:50:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:50:00,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:00,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:00,173 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 751875617, now seen corresponding path program 1 times [2019-12-19 03:50:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:00,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106727062] [2019-12-19 03:50:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:00,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106727062] [2019-12-19 03:50:00,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:00,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:50:00,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080762433] [2019-12-19 03:50:00,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:50:00,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:00,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:50:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:50:00,231 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-12-19 03:50:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:00,505 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-12-19 03:50:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:50:00,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 03:50:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:00,631 INFO L225 Difference]: With dead ends: 43856 [2019-12-19 03:50:00,632 INFO L226 Difference]: Without dead ends: 43352 [2019-12-19 03:50:00,632 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-19 03:50:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-12-19 03:50:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-12-19 03:50:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-12-19 03:50:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-12-19 03:50:01,911 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-12-19 03:50:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:01,911 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-12-19 03:50:01,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:50:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-12-19 03:50:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:01,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:01,922 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-19 03:50:01,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash 807428207, now seen corresponding path program 1 times [2019-12-19 03:50:01,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:01,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897099864] [2019-12-19 03:50:01,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:02,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897099864] [2019-12-19 03:50:02,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:02,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:02,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006040816] [2019-12-19 03:50:02,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:02,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:02,066 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-12-19 03:50:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:02,738 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-12-19 03:50:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:02,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:50:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:02,835 INFO L225 Difference]: With dead ends: 54549 [2019-12-19 03:50:02,835 INFO L226 Difference]: Without dead ends: 54549 [2019-12-19 03:50:02,836 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-19 03:50:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-12-19 03:50:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-12-19 03:50:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-12-19 03:50:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-12-19 03:50:05,979 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-12-19 03:50:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:05,980 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-12-19 03:50:05,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-12-19 03:50:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:05,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:05,990 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-19 03:50:05,990 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1694931888, now seen corresponding path program 1 times [2019-12-19 03:50:05,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:05,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255365592] [2019-12-19 03:50:05,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:06,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255365592] [2019-12-19 03:50:06,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:06,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:06,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231086785] [2019-12-19 03:50:06,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:06,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:06,075 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-12-19 03:50:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:06,133 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-12-19 03:50:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:06,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 03:50:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:06,147 INFO L225 Difference]: With dead ends: 8163 [2019-12-19 03:50:06,147 INFO L226 Difference]: Without dead ends: 6754 [2019-12-19 03:50:06,148 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-19 03:50:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-12-19 03:50:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-12-19 03:50:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-19 03:50:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-12-19 03:50:06,251 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-12-19 03:50:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:06,252 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-12-19 03:50:06,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-12-19 03:50:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:50:06,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:06,255 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] [2019-12-19 03:50:06,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2058299368, now seen corresponding path program 1 times [2019-12-19 03:50:06,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:06,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055143111] [2019-12-19 03:50:06,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:06,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055143111] [2019-12-19 03:50:06,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:06,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:06,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401279050] [2019-12-19 03:50:06,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:06,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:06,316 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 4 states. [2019-12-19 03:50:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:06,452 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-12-19 03:50:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:06,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 03:50:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:06,466 INFO L225 Difference]: With dead ends: 7891 [2019-12-19 03:50:06,467 INFO L226 Difference]: Without dead ends: 7891 [2019-12-19 03:50:06,467 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-19 03:50:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-12-19 03:50:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-12-19 03:50:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-19 03:50:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-12-19 03:50:06,569 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-12-19 03:50:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:06,569 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-12-19 03:50:06,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-12-19 03:50:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:50:06,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:06,573 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] [2019-12-19 03:50:06,573 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -315489033, now seen corresponding path program 1 times [2019-12-19 03:50:06,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:06,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323820325] [2019-12-19 03:50:06,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:06,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323820325] [2019-12-19 03:50:06,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:06,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:06,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700960250] [2019-12-19 03:50:06,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:06,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:06,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:06,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:06,634 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 6 states. [2019-12-19 03:50:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:06,989 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-12-19 03:50:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:50:06,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 03:50:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:07,006 INFO L225 Difference]: With dead ends: 9268 [2019-12-19 03:50:07,006 INFO L226 Difference]: Without dead ends: 9220 [2019-12-19 03:50:07,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:50:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-19 03:50:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-12-19 03:50:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-12-19 03:50:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-12-19 03:50:07,120 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-12-19 03:50:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:07,121 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-12-19 03:50:07,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-12-19 03:50:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:07,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:07,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:07,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 502763189, now seen corresponding path program 1 times [2019-12-19 03:50:07,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:07,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005645482] [2019-12-19 03:50:07,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:07,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005645482] [2019-12-19 03:50:07,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:07,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:07,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603811148] [2019-12-19 03:50:07,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:07,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:07,183 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-12-19 03:50:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:07,400 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-12-19 03:50:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:50:07,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 03:50:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:07,414 INFO L225 Difference]: With dead ends: 10665 [2019-12-19 03:50:07,414 INFO L226 Difference]: Without dead ends: 10665 [2019-12-19 03:50:07,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-19 03:50:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-12-19 03:50:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-19 03:50:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-12-19 03:50:07,529 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-12-19 03:50:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:07,530 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-12-19 03:50:07,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-12-19 03:50:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:07,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:07,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:07,537 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1747527670, now seen corresponding path program 1 times [2019-12-19 03:50:07,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:07,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273190593] [2019-12-19 03:50:07,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:07,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273190593] [2019-12-19 03:50:07,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:07,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:07,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417694242] [2019-12-19 03:50:07,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:07,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:07,634 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-12-19 03:50:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:08,077 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-12-19 03:50:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:08,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 03:50:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:08,090 INFO L225 Difference]: With dead ends: 10385 [2019-12-19 03:50:08,091 INFO L226 Difference]: Without dead ends: 10385 [2019-12-19 03:50:08,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-19 03:50:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-12-19 03:50:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-12-19 03:50:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-12-19 03:50:08,216 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-12-19 03:50:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:08,216 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-12-19 03:50:08,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-12-19 03:50:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:08,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:08,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:08,227 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -329681673, now seen corresponding path program 1 times [2019-12-19 03:50:08,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:08,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616201951] [2019-12-19 03:50:08,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:08,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616201951] [2019-12-19 03:50:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:08,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:08,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753860010] [2019-12-19 03:50:08,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:08,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:08,339 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-12-19 03:50:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:08,737 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-12-19 03:50:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:50:08,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 03:50:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:08,758 INFO L225 Difference]: With dead ends: 11999 [2019-12-19 03:50:08,758 INFO L226 Difference]: Without dead ends: 11999 [2019-12-19 03:50:08,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:50:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-12-19 03:50:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-12-19 03:50:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-12-19 03:50:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-12-19 03:50:09,080 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-12-19 03:50:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:09,080 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-12-19 03:50:09,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-12-19 03:50:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:09,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:09,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:09,090 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash -118330760, now seen corresponding path program 1 times [2019-12-19 03:50:09,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:09,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735403923] [2019-12-19 03:50:09,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:09,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-19 03:50:09,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735403923] [2019-12-19 03:50:09,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:09,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:09,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208610485] [2019-12-19 03:50:09,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:09,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:09,160 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-12-19 03:50:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:09,464 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-12-19 03:50:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:50:09,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 03:50:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:09,481 INFO L225 Difference]: With dead ends: 12576 [2019-12-19 03:50:09,481 INFO L226 Difference]: Without dead ends: 12576 [2019-12-19 03:50:09,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-12-19 03:50:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-12-19 03:50:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-19 03:50:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-12-19 03:50:09,624 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-12-19 03:50:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:09,624 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-12-19 03:50:09,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-12-19 03:50:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:09,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:09,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:09,632 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:09,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash -628864937, now seen corresponding path program 1 times [2019-12-19 03:50:09,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:09,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412435466] [2019-12-19 03:50:09,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:09,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412435466] [2019-12-19 03:50:09,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:09,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:09,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287666362] [2019-12-19 03:50:09,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:09,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:09,708 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-12-19 03:50:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:10,575 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-12-19 03:50:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:10,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 03:50:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:10,599 INFO L225 Difference]: With dead ends: 17070 [2019-12-19 03:50:10,599 INFO L226 Difference]: Without dead ends: 17070 [2019-12-19 03:50:10,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-12-19 03:50:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-12-19 03:50:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-19 03:50:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-12-19 03:50:10,793 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-12-19 03:50:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:10,793 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-12-19 03:50:10,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-12-19 03:50:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:10,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:10,801 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 258638744, now seen corresponding path program 1 times [2019-12-19 03:50:10,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:10,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189579488] [2019-12-19 03:50:10,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:10,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189579488] [2019-12-19 03:50:10,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:10,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:10,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523689553] [2019-12-19 03:50:10,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:10,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:10,850 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-12-19 03:50:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:11,312 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-12-19 03:50:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:11,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 03:50:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:11,330 INFO L225 Difference]: With dead ends: 14460 [2019-12-19 03:50:11,330 INFO L226 Difference]: Without dead ends: 13986 [2019-12-19 03:50:11,331 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-19 03:50:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-12-19 03:50:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-12-19 03:50:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-19 03:50:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-12-19 03:50:11,501 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-12-19 03:50:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:11,501 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-12-19 03:50:11,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-12-19 03:50:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:11,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:11,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:11,510 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1869151000, now seen corresponding path program 1 times [2019-12-19 03:50:11,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:11,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717767689] [2019-12-19 03:50:11,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:11,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717767689] [2019-12-19 03:50:11,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:11,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 03:50:11,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441139352] [2019-12-19 03:50:11,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 03:50:11,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 03:50:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:50:11,647 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-12-19 03:50:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:12,411 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-12-19 03:50:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:50:12,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-19 03:50:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:12,433 INFO L225 Difference]: With dead ends: 19154 [2019-12-19 03:50:12,434 INFO L226 Difference]: Without dead ends: 19154 [2019-12-19 03:50:12,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:50:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-12-19 03:50:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-12-19 03:50:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-12-19 03:50:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-12-19 03:50:12,641 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-12-19 03:50:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:12,641 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-12-19 03:50:12,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 03:50:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-12-19 03:50:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:50:12,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:12,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:12,650 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1538312615, now seen corresponding path program 1 times [2019-12-19 03:50:12,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:12,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894886634] [2019-12-19 03:50:12,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894886634] [2019-12-19 03:50:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276277400] [2019-12-19 03:50:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:12,766 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-12-19 03:50:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:12,812 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-12-19 03:50:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:50:12,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 03:50:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:12,817 INFO L225 Difference]: With dead ends: 4904 [2019-12-19 03:50:12,817 INFO L226 Difference]: Without dead ends: 4032 [2019-12-19 03:50:12,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-12-19 03:50:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-12-19 03:50:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-19 03:50:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-12-19 03:50:12,852 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-12-19 03:50:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:12,852 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-12-19 03:50:12,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-12-19 03:50:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:12,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:12,856 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] [2019-12-19 03:50:12,857 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 814821392, now seen corresponding path program 1 times [2019-12-19 03:50:12,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:12,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184416896] [2019-12-19 03:50:12,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:12,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184416896] [2019-12-19 03:50:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:12,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:12,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763030843] [2019-12-19 03:50:12,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:12,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:12,942 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-12-19 03:50:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:12,982 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-12-19 03:50:12,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:12,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-19 03:50:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:12,987 INFO L225 Difference]: With dead ends: 3364 [2019-12-19 03:50:12,988 INFO L226 Difference]: Without dead ends: 3364 [2019-12-19 03:50:12,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-19 03:50:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-12-19 03:50:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-19 03:50:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-12-19 03:50:13,022 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-12-19 03:50:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:13,022 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-12-19 03:50:13,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-12-19 03:50:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:13,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:13,025 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] [2019-12-19 03:50:13,025 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1492664144, now seen corresponding path program 1 times [2019-12-19 03:50:13,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:13,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819344294] [2019-12-19 03:50:13,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:13,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819344294] [2019-12-19 03:50:13,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:13,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:50:13,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389647561] [2019-12-19 03:50:13,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:50:13,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:13,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:50:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:13,184 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 8 states. [2019-12-19 03:50:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:13,605 INFO L93 Difference]: Finished difference Result 3633 states and 8221 transitions. [2019-12-19 03:50:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 03:50:13,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-19 03:50:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:13,611 INFO L225 Difference]: With dead ends: 3633 [2019-12-19 03:50:13,611 INFO L226 Difference]: Without dead ends: 3611 [2019-12-19 03:50:13,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 03:50:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2019-12-19 03:50:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3165. [2019-12-19 03:50:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-12-19 03:50:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-12-19 03:50:13,644 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-12-19 03:50:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:13,644 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-12-19 03:50:13,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:50:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-12-19 03:50:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:13,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:13,647 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] [2019-12-19 03:50:13,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -605160463, now seen corresponding path program 1 times [2019-12-19 03:50:13,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:13,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333819286] [2019-12-19 03:50:13,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:13,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333819286] [2019-12-19 03:50:13,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:13,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 03:50:13,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312566789] [2019-12-19 03:50:13,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 03:50:13,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 03:50:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:50:13,801 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-12-19 03:50:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:14,377 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-12-19 03:50:14,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 03:50:14,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-19 03:50:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:14,386 INFO L225 Difference]: With dead ends: 11435 [2019-12-19 03:50:14,387 INFO L226 Difference]: Without dead ends: 7337 [2019-12-19 03:50:14,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:50:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-12-19 03:50:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-12-19 03:50:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-12-19 03:50:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-12-19 03:50:14,436 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-12-19 03:50:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:14,436 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-12-19 03:50:14,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 03:50:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-12-19 03:50:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:14,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:14,441 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] [2019-12-19 03:50:14,441 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash -779070116, now seen corresponding path program 1 times [2019-12-19 03:50:14,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:14,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910861511] [2019-12-19 03:50:14,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:14,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910861511] [2019-12-19 03:50:14,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:14,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:14,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217808328] [2019-12-19 03:50:14,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:14,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:14,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:14,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:14,559 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 6 states. [2019-12-19 03:50:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:14,808 INFO L93 Difference]: Finished difference Result 3693 states and 8318 transitions. [2019-12-19 03:50:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:50:14,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-19 03:50:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:14,813 INFO L225 Difference]: With dead ends: 3693 [2019-12-19 03:50:14,813 INFO L226 Difference]: Without dead ends: 3621 [2019-12-19 03:50:14,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-12-19 03:50:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3182. [2019-12-19 03:50:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-12-19 03:50:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-12-19 03:50:14,845 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-12-19 03:50:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:14,845 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-12-19 03:50:14,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-12-19 03:50:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:14,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:14,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:14,848 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1438687837, now seen corresponding path program 2 times [2019-12-19 03:50:14,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:14,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086210009] [2019-12-19 03:50:14,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:14,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086210009] [2019-12-19 03:50:14,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:14,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:50:14,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543574633] [2019-12-19 03:50:14,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:50:14,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:50:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:14,985 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-12-19 03:50:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:15,073 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-12-19 03:50:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:50:15,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-19 03:50:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:15,076 INFO L225 Difference]: With dead ends: 5397 [2019-12-19 03:50:15,076 INFO L226 Difference]: Without dead ends: 2304 [2019-12-19 03:50:15,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:50:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-19 03:50:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-12-19 03:50:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-19 03:50:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-12-19 03:50:15,109 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-12-19 03:50:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:15,109 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-12-19 03:50:15,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:50:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-12-19 03:50:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:15,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:15,112 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] [2019-12-19 03:50:15,113 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:15,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1677225695, now seen corresponding path program 3 times [2019-12-19 03:50:15,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:15,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724311779] [2019-12-19 03:50:15,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:15,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724311779] [2019-12-19 03:50:15,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:15,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:15,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121021775] [2019-12-19 03:50:15,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:15,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:15,204 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-12-19 03:50:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:15,267 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-12-19 03:50:15,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:50:15,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-19 03:50:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:15,271 INFO L225 Difference]: With dead ends: 2429 [2019-12-19 03:50:15,272 INFO L226 Difference]: Without dead ends: 2429 [2019-12-19 03:50:15,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 03:50:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-19 03:50:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-12-19 03:50:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-19 03:50:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-12-19 03:50:15,326 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-12-19 03:50:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:15,326 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-12-19 03:50:15,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-12-19 03:50:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-19 03:50:15,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:15,331 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] [2019-12-19 03:50:15,331 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash -641388152, now seen corresponding path program 1 times [2019-12-19 03:50:15,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:15,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250629448] [2019-12-19 03:50:15,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:50:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:50:15,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:50:15,497 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:50:15,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:50:15 BasicIcfg [2019-12-19 03:50:15,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:50:15,712 INFO L168 Benchmark]: Toolchain (without parser) took 45002.42 ms. Allocated memory was 145.2 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 100.4 MB in the beginning and 909.9 MB in the end (delta: -809.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,714 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.21 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 157.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.88 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,715 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,716 INFO L168 Benchmark]: RCFGBuilder took 762.83 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 112.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,717 INFO L168 Benchmark]: TraceAbstraction took 43288.73 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 111.7 MB in the beginning and 909.9 MB in the end (delta: -798.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 03:50:15,721 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.21 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 157.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.88 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.70 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.83 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 112.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43288.73 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 111.7 MB in the beginning and 909.9 MB in the end (delta: -798.2 MB). Peak memory consumption was 1.3 GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L799] 0 pthread_t t1635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L801] 0 pthread_t t1636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L736] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L736] 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) [L737] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 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)) [L738] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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))=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=2] [L739] 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)) [L740] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 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)) [L741] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L742] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 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 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L808] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L808] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L808] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L810] 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 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L812] 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 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7173 SDtfs, 8336 SDslu, 16031 SDs, 0 SdLazy, 5796 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 71604 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 350736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...